Repositorio Institucional
Repositorio Institucional
CONICET Digital
  • Inicio
  • EXPLORAR
    • AUTORES
    • DISCIPLINAS
    • COMUNIDADES
  • Estadísticas
  • Novedades
    • Noticias
    • Boletines
  • Ayuda
    • General
    • Datos de investigación
  • Acerca de
    • CONICET Digital
    • Equipo
    • Red Federal
  • Contacto
JavaScript is disabled for your browser. Some features of this site may not work without it.
  • INFORMACIÓN GENERAL
  • RESUMEN
  • ESTADISTICAS
 
Artículo

An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications

Mateos Diaz, Cristian MaximilianoIcon ; Zunino Suarez, Alejandro OctavioIcon ; Campo, Marcelo RicardoIcon
Fecha de publicación: 10/2010
Editorial: Pergamon-Elsevier Science Ltd
Revista: Computer Languages Systems & Structures
ISSN: 1477-8424
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:
Ciencias de la Computación

Resumen

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.
Palabras clave: FORK-JOIN PARALLELISM , IMPLICIT PARALLELISM , JAVA , NON-INVASIVE TUNING , PARALLEL COMPUTING
Ver el registro completo
 
Archivos asociados
Thumbnail
 
Tamaño: 1.080Mb
Formato: PDF
.
Descargar
Licencia
info:eu-repo/semantics/openAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Atribución-NoComercial-SinDerivadas 2.5 Argentina (CC BY-NC-ND 2.5 AR)
Identificadores
URI: http://hdl.handle.net/11336/96681
DOI: http://dx.doi.org/10.1016/j.cl.2009.12.003
URL: https://www.sciencedirect.com/science/article/pii/S1477842410000035
Colecciones
Articulos(ISISTAN)
Articulos de INSTITUTO SUPERIOR DE INGENIERIA DEL SOFTWARE
Citación
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
Compartir
Altmétricas
 

Enviar por e-mail
Separar cada destinatario (hasta 5) con punto y coma.
  • Facebook
  • X Conicet Digital
  • Instagram
  • YouTube
  • Sound Cloud
  • LinkedIn

Los contenidos del CONICET están licenciados bajo Creative Commons Reconocimiento 2.5 Argentina License

https://www.conicet.gov.ar/ - CONICET

Inicio

Explorar

  • Autores
  • Disciplinas
  • Comunidades

Estadísticas

Novedades

  • Noticias
  • Boletines

Ayuda

Acerca de

  • CONICET Digital
  • Equipo
  • Red Federal

Contacto

Godoy Cruz 2290 (C1425FQB) CABA – República Argentina – Tel: +5411 4899-5400 repositorio@conicet.gov.ar
TÉRMINOS Y CONDICIONES