BSP versus LogP

Algorithmica (New York)

Volumn 24, Issue 3, 1999, Pages 405-422

  Bilardi, G ^a,b   Herley, K T ^c   Pietracaprina, A ^a   Pucci, G ^a   Spirakis, P ^d  

^a UNIVERSITY OF PADOVA   (Italy)

^b 1120 Science and Engineering Offices   (United States)

^c UNIVERSITY COLLEGE CORK   (Ireland)

^d University of Patras and Computer Technology Institute   (Greece)

Author keywords

Bridging models; Bsp model; Logp model; Models of computation; Parallel computation; Portability

Indexed keywords

EID: 0347718221     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008270     Document Type: Article

References (37)

1. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.
2. D. E. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E Santos, R Subramonian, and T. V. Eicken. LogP: towards a realistic model of parallel computation. In Proc. of the Fourth ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, pages 1-12, May 1993.
3. D. E. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos, K. E. Schauser, R. Subramonian, and T. V. Eicken. LogP: a practical model of parallel computation. Communications of the ACM, 39(11):78-85, November 1996.
4. A. V. Gerbessiotis and E. G. Valiant. Direct hulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22(2):251-267, 1994.
5. W. F McColl. BSP programming. In K. M. Chandy G. E. Blelloch, and S. Jagannathan, editors, DIMACS Series in Discrete Mathematics. pages 21-3. American Mathematical Society, Providence, RI, 1994.
6. W. F. McColl. General purpose parallel computing. In A. M. Gibbons and P. Spirakis, editors, Proc. of the 1991 ALCOM Spring School on Parallel Computation, pages 337-391. Warwick, England. Cambridge University Press, Cambridge, 1993.
7. W. F. McColl. Scalable computing. In J. Van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, pages 46-61. LNCS 1000. Springer-Verlag, Berlin. 1995.
8. G. E. Blelloch, P. B. Gibbons, Y. Matias, and M. Zagha. Accounting for memory bank contention and delay in high-bandwidth multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 8(9):943-958, September 1997.
9. T. Cheatham, A. Fahmy, D. Stefanescu, and E. Valiant. Bulk synchronous parallel computing - a paradigm for transportable software. In Proc. of the 28th Annual Hawaii Conference on System Sciences, volume II, pages 268-275. IEEE Computer Society Press, Los Alamitos, CA, January 1995.
10. M. Adler, J. W. Byers, and R. M. Karp. Parallel sorting with limited bandwidth. In Proc. of the 7th ACM Symp. on Parallel Algorithms and Architectures, pages 129-136, Santa Barbara, CA, July 1995.
11. A. Bäumker, W. Dittrich, and F. Meyer auf der Heide. Truly efficient parallel algorithms: c-optimal multisearch for and extension of the BSP model. In Proc. of the 3rd European Symposium on Algorithms, pages 17-30. ENCS 979, Springer-Verlag, Berlin, 1995.
12. B. H. H. Juurlink and H. A. G. Wijshoff. A quantitative comparison of paralle compulation models. In Proc. of the 8th ACM Symp. on Parallel Algorithms and Architectures, pages 13-24, June 1996.
13. P. De la Torre and C. P. Kruskal. Submachine locality in the hulk synchronous setting. In Proc. of EUROPAR 96, pages 352-358. ENCS 1124. Springer-Verlag, Berlin, 1996.
14. 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. Technical report. Oxford University Computing Eahoralory. Wolfson Building, Parks Rd., Oxford OX1 3QD, England, 1996.
15. M. Goudreau, K. Lang, S. Rao, T. Suel, and T. Tsantilas. Towards efficiency and portability: programming with the BSP model. In Proc. of the 8th ACM Symp. on Parallel Algorithms and Architectures, pages 1-12, June 1996.
16. D. E. Culler, A. Dusseau, R. Martin, and K. E. Shauser. Fast parallel sorting under LogP: from theory to practice. In Proc. of the Workshop on Portability and Performance for Parallel Processors, pages 18-29, Southampton, England, July 1993.
17. R. Karp, A. Sahay, E. E. Santos, and K. E. Shauser. Optimal broadcast and summation in the LogP model. In Proc. of the 5th ACM Symp. on Parallel Algorithms and Architectures, pages 142-153, Velen, Germany, 1993.
18. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: incorporating long messages into the LogP model. In Proc. of the 7th ACM Symp. on Parallel Algorithms and Architectures, pages 95-105, Santa Barbara, CA, July 1995.
19. M. Adler, J. W. Byers, and R. M. Karp. Scheduling parallel communication: the h-relation problem. In Proc. of the 20th International Symp. on Mathematical foundations of Computer Science, pages 1-20. LNCS 969, Springer-Verlag, Berlin, 1995.
20. W. J. Dally. Performance analysis of k-ary n-cube interconnection networks. IEEE Transactions on Computers, 39(6):775-785, June 1990.
21. G. Bilardi, K. T. Herley, A. Pietracaprina, G. Pucci, and P. Spirakis. BSP vs LogP. In Proc. of the 8th ACM Symposium on Parallel Algorithms and Architectures, pages 25-32, June 1996.
22. V. Ramachandran. Personal communication, June 1998.
23. V. Ramachandran, B. Grayson, and M. Dahlin. Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design. To appear in Proc. of the 10th ACM-SIAM Symp. on Discrete Algorithms, Baltimore, MD, January 1999.
24. M. T. Goodrich. Communication-efficient parallel sorting. In Proc. of the 28th ACM Symp. on Theory of Computing, pages 247-256, Philadelphia, PA, May 1996.
25. A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the postal model for message-passing systems. In Proc. of the 4th ACM Symposium on Parallel Algorithms and Architectures, pages 13-22, June 1992.
26. B. Bollobàs. Graph Theory: An Introductory Course. Springer-Verlag, New York, 1979.
27. M. Ajtai, J. Komlòs, and E. Szemerèdi. Sorting in clog n parallel steps. Combinatorica, 3(1):1-19, 1983.
28. R. Cypher and J. L. C. Sanz. Cubesort: a parallel algorithm for sorting n data items with s-sorters. Journal of Algorithms, 13:211-234, 1992.
29. D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley, Reading, MA, 1973.
30. T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 33(6):305-308, February 1990.
31. L. G. Valiant. General purpose parallel computing. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 18, pages 944-996. Elsevier, Amsterdam, 1990.
32. C. D. Thompson. A complexity theory for VLSI. Ph.D. thesis, Technical Report CMU-CS-80-140, Dept. of Computer Science, Carnegie-Mellon University. Pittsburgh, PA, Aug. 1980.
33. J. F. Sibeyn and M. Kaufmann. Deterministic 1-k routing on meshes, with application to hot-potato worm-hole routing. In Proc. of the 11th Symp. on Theoretical Aspects of Computer Science, pages 237-248. LNCS 775, Springer-Verlag, Berlin, 1994.
34. P. Bay and G. Bilardi. Deterministic on-line routing on area-universal networks. Journal of the ACM, 42(3):614-640, May 1995.
35. A. Aggarwal, A. K. Chandra, and M. Snir. Communication complexity of PRAMs. Theoretical Computer Science, 71:3-28, 1990.
36. B. M. Maggs, L. R. Matheson, and R. E. Tarjan. Models of parallel computation: a survey and synthesis. In Proc. of the 28th Hawaii International Conference on System Sciences (HICSS), volume 2, pages 61-70, January 1995.
37. P. B. Gibbons, Y. Matias, and V. Ramachandran. Can a shared-memory model serve as a bridging model for parallel computation? In Proc. of the 9th ACM Symp. on Parallel Algorithms and Architectures, pages 72-83, Newport, RI, June 1997.