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.
Chapter PDF
Similar content being viewed by others
Keywords
- Performance Prediction
- Resource Allocation Problem
- Message Size
- Dynamic Program Principle
- Partition Process
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
Abandah, G. A., Davidson, E. S. Modelling the Communication Performance of theIBMP-SP2. 10thIPPS. 1996.
Arruabarrena, J. M., Arruabarrena A., Beivide R., Gregorio J. A. Assessing the Performance of the New IBM-SP2 Communication Subsystem. IEEE Parallel and Distributed Technology. pp. 12–22. 1996.
Goudreau, M. Hill, J., Lang, K. McColl, B., Rao, S., Stephanescu, D., Suel, T., Tsantilas, T. A Proposal for the BSP Worldwide Standard Library. http://www.bsp-worldwide.org/standard/stand2.htm. 1996.
Morales, D. G. Almeida F., García F., Roda J. L., Rodríguez C. Design of Parallel Algorithms for the Single Resource Allocation Problem. European Journal of Operational Research. 126 pp. 166–174. 2000.
Olaf Bonorden, Ben Juurlink, Ingo von Otte, Ingo Rieping-The Paderborn University BSP (PUB) Library-Desing, Implementation and Performance-13thInternational Parallel Processing Symposium & 10th Symposium on parallel and Distributed Processing (IPPs/SPDP). 1999.
Hill J. McColl W. Stefanescu D. Goudreau M.. Lang K. Rao S. Suel T. Tsantilas T. Bisseling R. BSPLib: 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.
Zavanella, A. Milazzo, A. Predictability of Bulk Synchronous Programs Using MPI. 8th Euromicro PDP pp. 118–123. 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, J.A. et al. (2001). Performance Prediction of Oblivious BSP Programs. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive