Portability of performance with the BSPLib communications library

Proceedings - 3rd Working Conference on Massively Parallel Programming Models, MPPM 1997

Volumn , Issue , 1997, Pages 33-42

  Hill, J M D ^a   Donaldson, S R ^a   Skillicorn, D ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROGRAMMING;

BROADCAST ALGORITHM; BSP COST MODEL; NETWORK BANDWIDTH; NETWORKS OF WORKSTATIONS; PARALLEL COMPUTER; PARTICULAR ALGORITHMS; SIMILAR ANALYSIS; SOURCE CODES;

TREES (MATHEMATICS);

EID: 0348018582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MPPM.1997.715959     Document Type: Conference Paper

References (19)

1. M. Barnett, D. Payne, R. van de Geijn, and J. Watts. Broadcasting on meshes with wormhole routing. Journal of Parallel and Distributed Computing, 35(2):111-122, 1996.
2. P. I. Crumpton and M. B. Giles. Multigrid aircraft computations using the OPlus parallel library. In Parallel Computational Fluid Dynamics: Implementation and Results using Parallel Computers. Proceedings Parallel CFD'95, pages 339-346, Pasadena, CA, USA, June 1995. Elsevier/North-Holland.
3. S. R. Donaldson, J. M. D. Hill, and D. B. Skillicorn. Predictable communication on unpredictable networks: Implementing BSP over TCP/IP. Technical Report PRG-TR-40-97, Programming Research Group, Oxford University Computing Laboratory, November 1997.
4. W. D. Frazer and A. C. McKellar. Samplesort: A sampling approach to minimal storage tree sorting. Journal of the ACM, 17(3):496-507, 1970.
5. A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22(2):251-267, Aug. 1994.
6. J. M. D. Hill, P. I. Crumpton, and D. A. Burgess. Theory, practice, and a tool for BSP performance prediction. In EuroPar'96, number 1124 in LNCS, pages 697-705, Lyon, France, Aug. 1996. Springer-Verlag.
7. J. M. D. Hill, S. R. 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, Programming Research Group, Oxford University Computing Laboratory, October 1997.
8. 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. Technical Report PRG-TR-29-97, Oxford University Computing Laboratory, May 1997. see www. bsp-worldwide.org for details.
9. J. M. D. Hill and D. Skillicorn. Lessons learned from implementing BSP. Journal of Future Generation Computer Systems, March 1998.
10. J. M. D. Hill and D. B. Skillicorn. Practical barrier synchronisation. In 6th EuroMicro Workshop on Parallel and Distributed Processing (PDP'98), pages 438-444. IEEE Computer Society Press, January 1998.
11. C. A. R. Hoare. Quicksort. Computer Journal, 5(1):10-15, 1962.
12. J. S. Huang and Y. C. Chow. Parallel sorting and data partitioning by sampling. In IEEE Computer Society's Seventh International Computer Software & Applications Conference (COMPSAC'83), pages 627-631, Nov. 1983.
13. B. H. H. Juurlink and H. A. G. Wijshoff. Communication primitives for BSP computers. Information Processing Letters, 58:303-310, 1996.
14. D. E. Knuth. The Art of Computer Programming. Volume III: Sorting and Searching. Addison-Wesley, 1973.
15. W. F. McColl. Scalable computing. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, number 1000 in Lecture Notes in Computer Science, pages 46-61. Springer-Verlag, 1995.
16. J. Reed, K. Parrott, and T. Lanfear. Portability, predictability and performance for parallel computing: BSP in practice. Concurrency: Practice and Experience, 8(10):799-812, December 1996.
17. J. H. Reif and L. G. Valiant. A logarithmic time sort for linear size networks. Journal of the ACM, 34(l):60-76, 1987.
18. D. Skillicorn, J. M. D. Hill, and W. F. McColl. Questions and answers about BSP. Scientific Programming, 6(3):249-274, Fall 1997.
19. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.