Solving parallel problems by OTMP model
- Autores
- Piccoli, María Fabiana; Printista, Alicia Marcela; Gonzalez, Jesús Alberto; León, Coromoto; Roda García, José Luis; Rodriguez, C.; Sande, Francisco de
- Año de publicación
- 2003
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- Since the early stages of parallel computing, one of the most common solutions to in troduce parallelism has been to extend a sequential language with some sort of parallel version of the for construct, commonly denoted as forall construct. Although similar syntax, these forall loops di er in their semantics and implementations. The High Performance Fortran (HPF) and OpenMP versions are, likely, among the most popular. This paper presents yet another forall loop extension for the C language. In this work, we introduce a parallel computation model: One Thread Multiple Processor Model (OTMP). This model proposes an abstract machine, a programming model and cost model. The programming model de nes another forall loop construct, the theorical machine aims for both homogeneous shared and distributed memory computers, and the cost model allo ws the prediction of the performance of a program. OTMP does not only in tegrates and extends sequential programming, but also includes and expands the message passing programming model. The model allows and exploits any nested levels of parallelism, taking advan tage of situations where there are several small nested loops.
Eje: Procesamiento distribuido y paralelo (PDP)
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Distributed Systems
Parallel programming
computation model
abstract machine
programming model
cost model - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/22749
Ver los metadatos del registro completo
id |
SEDICI_22763e28749dcc1c9ccdc58e89881d67 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/22749 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Solving parallel problems by OTMP modelPiccoli, María FabianaPrintista, Alicia MarcelaGonzalez, Jesús AlbertoLeón, CoromotoRoda García, José LuisRodriguez, C.Sande, Francisco deCiencias InformáticasDistributed SystemsParallel programmingcomputation modelabstract machineprogramming modelcost modelSince the early stages of parallel computing, one of the most common solutions to in troduce parallelism has been to extend a sequential language with some sort of parallel version of the for construct, commonly denoted as forall construct. Although similar syntax, these forall loops di er in their semantics and implementations. The High Performance Fortran (HPF) and OpenMP versions are, likely, among the most popular. This paper presents yet another forall loop extension for the C language. In this work, we introduce a parallel computation model: One Thread Multiple Processor Model (OTMP). This model proposes an abstract machine, a programming model and cost model. The programming model de nes another forall loop construct, the theorical machine aims for both homogeneous shared and distributed memory computers, and the cost model allo ws the prediction of the performance of a program. OTMP does not only in tegrates and extends sequential programming, but also includes and expands the message passing programming model. The model allows and exploits any nested levels of parallelism, taking advan tage of situations where there are several small nested loops.Eje: Procesamiento distribuido y paralelo (PDP)Red de Universidades con Carreras en Informática (RedUNCI)2003-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf433-444http://sedici.unlp.edu.ar/handle/10915/22749enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:11Zoai:sedici.unlp.edu.ar:10915/22749Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:12.098SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Solving parallel problems by OTMP model |
title |
Solving parallel problems by OTMP model |
spellingShingle |
Solving parallel problems by OTMP model Piccoli, María Fabiana Ciencias Informáticas Distributed Systems Parallel programming computation model abstract machine programming model cost model |
title_short |
Solving parallel problems by OTMP model |
title_full |
Solving parallel problems by OTMP model |
title_fullStr |
Solving parallel problems by OTMP model |
title_full_unstemmed |
Solving parallel problems by OTMP model |
title_sort |
Solving parallel problems by OTMP model |
dc.creator.none.fl_str_mv |
Piccoli, María Fabiana Printista, Alicia Marcela Gonzalez, Jesús Alberto León, Coromoto Roda García, José Luis Rodriguez, C. Sande, Francisco de |
author |
Piccoli, María Fabiana |
author_facet |
Piccoli, María Fabiana Printista, Alicia Marcela Gonzalez, Jesús Alberto León, Coromoto Roda García, José Luis Rodriguez, C. Sande, Francisco de |
author_role |
author |
author2 |
Printista, Alicia Marcela Gonzalez, Jesús Alberto León, Coromoto Roda García, José Luis Rodriguez, C. Sande, Francisco de |
author2_role |
author author author author author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Distributed Systems Parallel programming computation model abstract machine programming model cost model |
topic |
Ciencias Informáticas Distributed Systems Parallel programming computation model abstract machine programming model cost model |
dc.description.none.fl_txt_mv |
Since the early stages of parallel computing, one of the most common solutions to in troduce parallelism has been to extend a sequential language with some sort of parallel version of the for construct, commonly denoted as forall construct. Although similar syntax, these forall loops di er in their semantics and implementations. The High Performance Fortran (HPF) and OpenMP versions are, likely, among the most popular. This paper presents yet another forall loop extension for the C language. In this work, we introduce a parallel computation model: One Thread Multiple Processor Model (OTMP). This model proposes an abstract machine, a programming model and cost model. The programming model de nes another forall loop construct, the theorical machine aims for both homogeneous shared and distributed memory computers, and the cost model allo ws the prediction of the performance of a program. OTMP does not only in tegrates and extends sequential programming, but also includes and expands the message passing programming model. The model allows and exploits any nested levels of parallelism, taking advan tage of situations where there are several small nested loops. Eje: Procesamiento distribuido y paralelo (PDP) Red de Universidades con Carreras en Informática (RedUNCI) |
description |
Since the early stages of parallel computing, one of the most common solutions to in troduce parallelism has been to extend a sequential language with some sort of parallel version of the for construct, commonly denoted as forall construct. Although similar syntax, these forall loops di er in their semantics and implementations. The High Performance Fortran (HPF) and OpenMP versions are, likely, among the most popular. This paper presents yet another forall loop extension for the C language. In this work, we introduce a parallel computation model: One Thread Multiple Processor Model (OTMP). This model proposes an abstract machine, a programming model and cost model. The programming model de nes another forall loop construct, the theorical machine aims for both homogeneous shared and distributed memory computers, and the cost model allo ws the prediction of the performance of a program. OTMP does not only in tegrates and extends sequential programming, but also includes and expands the message passing programming model. The model allows and exploits any nested levels of parallelism, taking advan tage of situations where there are several small nested loops. |
publishDate |
2003 |
dc.date.none.fl_str_mv |
2003-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/22749 |
url |
http://sedici.unlp.edu.ar/handle/10915/22749 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf 433-444 |
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_ |
1844615810499215360 |
score |
13.069144 |