On the Predictive Quality of BSP-like Cost Functions for NOWs
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
The Bulk-Synchronous Parallel (BSP) model  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.
- D. Bailey, E. Barszcz, J.T. Barton, tet al. The NAS parallel benchmarks. Int. J. Supercomputer Appl., 5(3):63–73, 1991. CrossRef
- 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.
- On the Predictive Quality of BSP-like Cost Functions for NOWs
- Book Title
- Euro-Par 2000 Parallel Processing
- Book Subtitle
- 6th International Euro-Par Conference Munich, Germany, August 29 – September 1, 2000 Proceedings
- pp 638-646
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 4. Institut für Informatik Lehrstuhl für Rechnertechnik und Rechnerorganisation, LRR-TUM, Technische Universität München
- Author Affiliations
- 5. Dipartimento di Elettronica e Informatica, Università di Padova, Padova, Italy
To view the rest of this content please follow the download PDF link above.