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.
Chapter PDF
Keywords
- Unwanted Consequence
- Communication Time
- Synchronization Point
- Barrier Synchronization
- Software Improvement
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bonorden O. Juurlink B. von Otte I. Rieping I. The Paderborn University BSP (PUB) Library-Design Implementation and Performance. Technical Report TR-RSFB-98-063. Heinz Nixdorf Institute. Paderborn University. 1998.
Gonzalez J.A., Leon C, Piccoli F., Printista M., Roda J.L., Rodriguez C, Sande F. Oblivious BSP. Internal Report, http://nereida.deioc.ull.es/html/obsp.ps.gz
Hill J. McColl W. Stefanescu D. Goudreau M. Lang K. Rao S. Suel T. Tsantilas T. Bisseling R. PLib: The BSP Programming Library. Parallel Computing. 24(14) pp. 1947–1980. 1988.
Valiant L.G. A Bridging Model for Parallel Computation. Communications of the ACM. 33(8). pp. 103–111. 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gonzalez, J.A. et al. (2000). Oblivious BSP. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_94
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive