DocumentCode
2896031
Title
Predicting the time of oblivious programs
Author
Gonzalez, Jose A. ; Leon, Coromoto ; Piccoli, Fabrizio ; Printista, M. ; Roda, J.L. ; Rodriguez, Claudia
Author_Institution
Dept. de EIOC, Univ. de La Laguna
fYear
2001
fDate
2001
Firstpage
363
Lastpage
368
Abstract
The BSP model can be extended with a zero cost synchronization mechanism that can be used when the numbers of messages due to receive is known. This mechanism, usually known as “oblivious synchronization”, implies that different processors can be in different supersteps at the same time. An unwanted consequence of these software improvements is a loss of accuracy in prediction. This paper proposes an extension of the BSP complexity model to deal with oblivious barriers and shows its accuracy
Keywords
computational complexity; parallel programming; synchronisation; BSP model; complexity model; oblivious programs; synchronization; Accuracy; Bandwidth; Costs; Out of order; Parallel programming; Partitioning algorithms; Pipelines; Predictive models; Software libraries; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 2001. Proceedings. Ninth Euromicro Workshop on
Conference_Location
Mantova
Print_ISBN
0-7695-0987-8
Type
conf
DOI
10.1109/EMPDP.2001.905063
Filename
905063
Link To Document