Abstract
The BSP cost model measures the cost of communication using a single architectural parameter, g, which measures permeability of the network to continuous traffic. Architectures, typically networks of workstations, pose particular problems for high-performance communication because it is hard to achieve high throughput, and even harder to do so predictably. Yet both of these are required for BSP to be effective. We present a technique for controlling applied communication load that achieves both. Traffic is presented to the communication network at a rate chosen to maximise throughput and minimise its variance. Performance improvements as large as a factor of two over MPI can be achieved.
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
S. R. Donaldson, J. M. D. Hill, and D. B. Skillicorn. Communication performance optimisation requires minimising variance. In High Perfomance Computing and Networking (HPCN’98), Amsterdam, April 1998.
W. Gropp and E. Lusk. A high-performance MPI implementation on a sharedmemory vector supercomputer. Parallel Computing, 22(11):1513–1526, Jan. 1997.
J. L. Hammond and P. J. P. O’Reilly. Performance Analysis of Local Computer Networks. Addison Wesley, 1987.
J. M. D. Hill, S. Donaldson, and D. B. Skillicorn. Stability of communication performance in practice: from the Cray T3E to networks of workstations. Technical Report PRG-TR-33-97, Oxford University Computing Laboratory, October 1997.
J. M. D. Hill, B. McColl, D. C. Stefanescu, M. W. Goudreau, K. Lang, S. B. Rao, T. Suel, T. Tsantilas, and R. Bisseling. BSPlib: The BSP Programming Library. Parallel Computing, to appear 1998. see www.bsp-worldwide.org for more details.
J. M. D. Hill and D. B. Skillicorn. Lessons learned from implementing BSP. Journal of Future Generation Computer Systems, 13(4–5):327–335, April 1998.
P. J. B. King. Computer and Communication Systems Performance Modelling. International series in Computer Science. Prentice Hall, 1990.
D. B. Skillicorn, J. M. D. Hill, and W. F. McColl. Questions and answers about BSP. Scientific Programming, 6(3):249–274, Fall 1997.
S. Tasaka. Performance Analysis of Multiple Access Protocols. Computer Systems Series. MIT Press, 1986.
L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, August 1990.
G. R. Wright and W. R. Stephens. TCP/IP Illustrated, Volume 2. Addison-Wesley, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Donaldson, S.R., Hill, J.M.D., Skillicorn, D.B. (1998). Predictable communication on unpredictable networks: Implementing BSP over TCP/IP. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057956
Download citation
DOI: https://doi.org/10.1007/BFb0057956
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive