Oblivious BSP (Research Note)

Authors:
Jesus A. Gonzalez;Coromoto Leon;Fabiana Piccoli;Marcela Printista;José L. Roda;Casiano Rodríguez;Francisco de Sande
Affiliations:
-;-;-;-;-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 2
Cited 1

A bridging model for parallel computation

Communications of the ACM
BSPlib: The BSP programming library

Parallel Computing

Hybrid bulk synchronous parallelism library for clustered smp architectures

Proceedings of the fourth international workshop on High-level parallel programming and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The BSP model can be extended with a zero cost synchronization mechanism, which can be used when the number 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 prediction accuracy. This paper proposes an extension of the BSP complexity model to deal with oblivious barriers and shows its accuracy.