Abstract
The Bulk-Synchronous Parallel (BSP) model [16] provides a simple and portable programming discipline that is particularly suitable for coarse-grained parallel systems such as Networks of Workstations (NOWs). In this work we examine the issue of predictability of the BSP cost function for a NOW consisting of SUN workstations connected through a 10Mbps Ethernet network. In particular, we compare the original BSP cost function with a number of newly proposed variants, with the intent of improving predictability by having the cost function encompass those parameters of the hardware/software system which have the largest impact on performance.
This research was supported, in part, by the Italian CNR, and by MURST under Project Algorithms for Large Data Sets: Science and Engineering.
Chapter PDF
Keywords
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
D. Bailey, E. Barszcz, J.T. Barton, tet al. The NAS parallel benchmarks. Int. J. Supercomputer Appl., 5(3):63–73, 1991.
K.E. Batcher. Sorting networks and their applications. In Proc. of the AFIPS Spring Joint Computer Conf., pages 307–314, 1968.
O. Bonorden, B. Juurlink, I. von Otte, and I Rieping. The Paderborn university BSP (PUB) Library-Design, Implementation and Performance In Proc. of the 2nd merged IPPS/SPDP Symp., pages 99–104, San Juan, Puerto Rico, April 1999.
G. Blelloch, C.E. Leiserson, B.M. Maggs, et al. A comparison of sorting algorithms for the connection machine CM-2. In Proc. of the 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 3–16, Hilton Head SC, USA, 1991.
G. Bilardi, A. Pietracaprina, and G. Pucci. A quantitative measure of portability with application to bandwidth-latency models for parallel computing. In Proc. EURO-PAR’99-Parallel Processing, pages 543–551, Toulouse, F, Aug./Sep 1999.
D.E. Culler, R. Karp, D. Patterson, tet al. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78–85, November 1996.
S.R. Donaldson, J.M.D. Hill, and D.B. Skillicorn. Predictable communication on unpredictable networks: Implementing BSP over TCP/IP. In Proc. EURO-PAR’98-Parallel Processing, pages 970–980, Southampton, UK, September 1998.
S.R. Donaldson, J.M.D. Hill, and D.B. Skillicorn. BSP clusters: high performance, reliable and very low cost. Technical report PRG-TR-5-98, Oxford University Computing Laboratory, Oxford, UK, 1998.
P. De la Torre and C.P. Kruskal. Submachine locality in the bulk synchronous setting. In In Proc. EURO-PAR’96-Parallel Processing, pages 352–358, Lyon, F, August 1996.
M. Goudreau, J.M.D. Hill, W. McColl, S. Rao, D.C. Stefanescu, T. Suel, and T. Tsantilas. A proposal for the BSP worldwide standard library. BSP Worldwide http://www.bspworldwide.org/, April 1996.
M. Goudreau, K. Lang, S. Rao, tet al. Portable and efficient parallel computing using the BSP model. IEEE Trans. on Computers, C-48(7):670–689, July 1999.
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
Bianco, M., Pucci, G. (2000). On the Predictive Quality of BSP-like Cost Functions for NOWs. 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_89
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_89
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