Mostrar el registro sencillo del ítem
dc.contributor.author
Mateos Diaz, Cristian Maximiliano
dc.contributor.author
Zunino Suarez, Alejandro Octavio
dc.contributor.author
Campo, Marcelo Ricardo
dc.date.available
2020-02-04T15:39:18Z
dc.date.issued
2010-10
dc.identifier.citation
Mateos Diaz, Cristian Maximiliano; Zunino Suarez, Alejandro Octavio; Campo, Marcelo Ricardo; An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications; Pergamon-Elsevier Science Ltd; Computer Languages Systems & Structures; 36; 3; 10-2010; 288-315
dc.identifier.issn
1477-8424
dc.identifier.uri
http://hdl.handle.net/11336/96681
dc.description.abstract
Motivated by the advent of powerful hardware such as SMP machines and execution environments such as Grids, research in parallel programming has gained much attention within the distributed computing community. There is a substantial body of efforts in the form of parallel libraries and frameworks that supply developers with programming tools to exploit parallelism in their applications. Still, many of these efforts prioritize performance over other important characteristics such as code invasiveness, ease of use and independence of the underlying executing hardware/environment. In this paper, we present EasyFJP, a new approach for semi-automatically injecting parallelism into sequential Java applications that offers a convenient balance to these four aspects. EasyFJP is based upon the popular fork/join parallel pattern, and combines implicit, application-level parallelism with explicit, non-invasive application tuning. Experiments performed with several classic CPU-intensive benchmarks and a real-world application confirm that EasyFJP effectively addresses these problems while delivers very competitive performance.
dc.format
application/pdf
dc.language.iso
eng
dc.publisher
Pergamon-Elsevier Science Ltd
dc.rights
info:eu-repo/semantics/openAccess
dc.rights.uri
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.subject
FORK-JOIN PARALLELISM
dc.subject
IMPLICIT PARALLELISM
dc.subject
JAVA
dc.subject
NON-INVASIVE TUNING
dc.subject
PARALLEL COMPUTING
dc.subject.classification
Ciencias de la Computación
dc.subject.classification
Ciencias de la Computación e Información
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS
dc.title
An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications
dc.type
info:eu-repo/semantics/article
dc.type
info:ar-repo/semantics/artículo
dc.type
info:eu-repo/semantics/publishedVersion
dc.date.updated
2020-01-22T20:55:13Z
dc.journal.volume
36
dc.journal.number
3
dc.journal.pagination
288-315
dc.journal.pais
Países Bajos
dc.journal.ciudad
Asmterdam
dc.description.fil
Fil: Mateos Diaz, Cristian Maximiliano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Instituto Superior de Ingeniería del Software. Universidad Nacional del Centro de la Provincia de Buenos Aires. Instituto Superior de Ingeniería del Software; Argentina
dc.description.fil
Fil: Zunino Suarez, Alejandro Octavio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Instituto Superior de Ingeniería del Software. Universidad Nacional del Centro de la Provincia de Buenos Aires. Instituto Superior de Ingeniería del Software; Argentina
dc.description.fil
Fil: Campo, Marcelo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Instituto Superior de Ingeniería del Software. Universidad Nacional del Centro de la Provincia de Buenos Aires. Instituto Superior de Ingeniería del Software; Argentina
dc.journal.title
Computer Languages Systems & Structures
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.cl.2009.12.003
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1477842410000035
Archivos asociados