Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster
- Autores
- Rucci, Enzo; Chichizola, Franco; De Giusti, Armando Eduardo; Naiouf, Marcelo; De Giusti, Laura Cristina; Simari, Guillermo Ricardo; Padovani, Hugo
- Año de publicación
- 2011
- Idioma
- español castellano
- Tipo de recurso
- parte de libro
- Estado
- versión publicada
- Descripción
- Taking into account the increase in use of the multi-core cluster architecture, in this paper we analyze the use of the various communication models (message passing, shared memory, their combination) to efficiently exploit the power of the architecture. Smith-Waterman algorithm, whose parallelization is based on a pipeline scheme due to problem data dependence, is used as test case to determine the similarity degree of two DNA sequences. Finally, future research lines are mentioned, aimed at optimizing the use of memory levels in the architecture.
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
multi-core cluster
hybrid communication model
pipeline
Smith-Waterman - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc/4.0/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/81222
Ver los metadatos del registro completo
id |
SEDICI_5c0e7e958de4e38c09ea99666fba1bd8 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/81222 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core ClusterRucci, EnzoChichizola, FrancoDe Giusti, Armando EduardoNaiouf, MarceloDe Giusti, Laura CristinaSimari, Guillermo RicardoPadovani, HugoCiencias Informáticasmulti-core clusterhybrid communication modelpipelineSmith-WatermanTaking into account the increase in use of the multi-core cluster architecture, in this paper we analyze the use of the various communication models (message passing, shared memory, their combination) to efficiently exploit the power of the architecture. Smith-Waterman algorithm, whose parallelization is based on a pipeline scheme due to problem data dependence, is used as test case to determine the similarity degree of two DNA sequences. Finally, future research lines are mentioned, aimed at optimizing the use of memory levels in the architecture.Red de Universidades con Carreras en Informática (RedUNCI)Editorial de la Universidad Nacional de La Plata (EDULP)2011-03-31info:eu-repo/semantics/bookPartinfo:eu-repo/semantics/publishedVersionCapitulo de librohttp://purl.org/coar/resource_type/c_3248info:ar-repo/semantics/parteDeLibroapplication/pdf71-81http://sedici.unlp.edu.ar/handle/10915/81222spainfo:eu-repo/semantics/altIdentifier/isbn/978-950-34-0713-4info:eu-repo/semantics/reference/hdl/10915/18411info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc/4.0/Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:15:02Zoai:sedici.unlp.edu.ar:10915/81222Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:15:02.838SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster |
title |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster |
spellingShingle |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster Rucci, Enzo Ciencias Informáticas multi-core cluster hybrid communication model pipeline Smith-Waterman |
title_short |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster |
title_full |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster |
title_fullStr |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster |
title_full_unstemmed |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster |
title_sort |
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster |
dc.creator.none.fl_str_mv |
Rucci, Enzo Chichizola, Franco De Giusti, Armando Eduardo Naiouf, Marcelo De Giusti, Laura Cristina Simari, Guillermo Ricardo Padovani, Hugo |
author |
Rucci, Enzo |
author_facet |
Rucci, Enzo Chichizola, Franco De Giusti, Armando Eduardo Naiouf, Marcelo De Giusti, Laura Cristina Simari, Guillermo Ricardo Padovani, Hugo |
author_role |
author |
author2 |
Chichizola, Franco De Giusti, Armando Eduardo Naiouf, Marcelo De Giusti, Laura Cristina Simari, Guillermo Ricardo Padovani, Hugo |
author2_role |
author author author author author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas multi-core cluster hybrid communication model pipeline Smith-Waterman |
topic |
Ciencias Informáticas multi-core cluster hybrid communication model pipeline Smith-Waterman |
dc.description.none.fl_txt_mv |
Taking into account the increase in use of the multi-core cluster architecture, in this paper we analyze the use of the various communication models (message passing, shared memory, their combination) to efficiently exploit the power of the architecture. Smith-Waterman algorithm, whose parallelization is based on a pipeline scheme due to problem data dependence, is used as test case to determine the similarity degree of two DNA sequences. Finally, future research lines are mentioned, aimed at optimizing the use of memory levels in the architecture. Red de Universidades con Carreras en Informática (RedUNCI) |
description |
Taking into account the increase in use of the multi-core cluster architecture, in this paper we analyze the use of the various communication models (message passing, shared memory, their combination) to efficiently exploit the power of the architecture. Smith-Waterman algorithm, whose parallelization is based on a pipeline scheme due to problem data dependence, is used as test case to determine the similarity degree of two DNA sequences. Finally, future research lines are mentioned, aimed at optimizing the use of memory levels in the architecture. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-03-31 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/bookPart info:eu-repo/semantics/publishedVersion Capitulo de libro http://purl.org/coar/resource_type/c_3248 info:ar-repo/semantics/parteDeLibro |
format |
bookPart |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/81222 |
url |
http://sedici.unlp.edu.ar/handle/10915/81222 |
dc.language.none.fl_str_mv |
spa |
language |
spa |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/isbn/978-950-34-0713-4 info:eu-repo/semantics/reference/hdl/10915/18411 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc/4.0/ Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc/4.0/ Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) |
dc.format.none.fl_str_mv |
application/pdf 71-81 |
dc.publisher.none.fl_str_mv |
Editorial de la Universidad Nacional de La Plata (EDULP) |
publisher.none.fl_str_mv |
Editorial de la Universidad Nacional de La Plata (EDULP) |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1844616022153232384 |
score |
13.070432 |