Abstract
The BSP model can be extended with a zero cost synchronization mechanism, which can be used when the number of messages due to receives 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 this software improvement 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.
Cite
CITATION STYLE
González, J. A., León, C., Piccoli, F., Printista, M., Roda, J. L., Rodríguez, C., & De Sande, F. (2001). Performance prediction of oblivious BSP programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2150, pp. 96–105). Springer Verlag. https://doi.org/10.1007/3-540-44681-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
