The bulk-synchronous parallel random access machine

Theoretical Computer Science

Volumn 196, Issue 1-2, 1998, Pages 109-130

  Tiskin, Alexandre ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Automatic memory management; BSP algorithms; BSP computing; PRAM simulation; Shared memory simulation

Indexed keywords

EID: 0346098076     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00197-7     Document Type: Article

References (28)

1. A. Aggarwal, A.K. Chandra, M. Snir, Communication complexity of PRAMs, Theoret. Comput. Sci. 71 (1990) 3-28.
2. C. Berge, Graphs, vol. 6, part 1 of North-Holland Mathematical Library, 2nd rev. ed., North-Holland, Amsterdam, 1985.
3. R. Cole, Parallel merge sort, in: J.H. Reif (Ed.), Synthesis of Parallel Algorithms, Morgan Kaufmann, Los Altos, CA, 1993, Ch. 10, pp. 453-495.
4. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbol. Comput. 9 (1990) 251-280.
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, the MIT Electrical Engineering and Computer Science Series, MIT Press, Cambridge, MA and McGraw-Hill, New York, 1990.
6. A.V. Gerbessiotis, C.J. Siniolakis, Deterministic sorting and randomized median finding on the BSP model, in: Proc. 8th ACM Symp. on Parallel Algorithms and Architectures, 1996, pp. 223-232.
7. P.B. Gibbons, Asynchronous PRAM algorithms, in: J.H. Reif (Ed.), Synthesis of Parallel Algorithms, Morgan Kaufmann, Los Altos, CA, 1993, Ch. 22, pp. 957-997.
8. P. Gibbons, Y. Matias, V. Ramachandran, Can a shared memory model serve as a bridging model for parallel computation?, in: Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, pp. 72-83, 1997, Extended abstract.
9. A. Gibbons, W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, Cambridge, 1988.
10. M. Goodrich, Communication-efficient parallel sorting. in: Proc. 28th ACM Symp. on Theory of Computing, 1996.
11. D.R. Helman, J. JáJá, D.A. Bader, A new deterministic parallel sorting algorithm with an experimental evaluation, Technical Report CS-TR-3670 and UMIACS-TR-96-54, Institute for Advanced Computer Studies, University of Maryland, August 1996.
12. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
13. R.M. Karp, V. Ramachandran. Parallel algorithms for shared memory machines, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, Ch. 17, pp. 869-941.
14. C.P. Kruskal, L. Rudolph, M. Snir, A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci. 71 (1990) 95-132.
15. X. Li, P. Lu, J. Schaeffer, J. Shillington, P.S. Wong, Hanmao Shi, On the versatility of parallel sorting by regular sampling, Parallel Comput. 19 (1993) 1079-1110.
16. Z. Li, P.H. Mills, J.H. Reif, Models and resource metrics for parallel and distributed computation, in: Proc. 28th Hawaii Internat. Conf. on System Sciences, IEEE Press, New York, 1995.
17. B.M. Maggs, L.R. Matheson, R.E. Tarjan, Models of parallel computation: a survey and synthesis, in: Proc. 28th Hawaii Internat. Conf. on System Sciences, IEEE Press, New York, 1995, vol. 2. pp. 61-70.
18. W.F. McColl, General purpose parallel computing, in: A. Gibbons, P. Spirakis (Eds.), Lectures on parallel computation, Cambridge International Series on Parallel Computation, vol. 4, Cambridge University Press, Cambridge. 1993, Ch. 13, pp 337-391.
19. W.F. McColl, Scalable computing, in: J. van Leeuwen (Ed.), Computer Science Today: Recent Trends and Developments, Lecture Notes in Computer Science, vol. 1000, Springer, Berlin, 1995, pp. 46-61.
20. W.F. McColl, Universal computing, in: L. Bougé, P. Fraigniaud, A. Mignotte, Y. Robert (Eds.). Proc. Euro-Par'96-I, Lecture Notes in Computer Science, vol. 1123, Springer, Berlin, 1996, pp. 25-36.
21. C.H. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, in: Proc. 20th Annual Symp. on Theory of Computing, 1988, pp. 510-513.
22. Hanmao Shi, J. Schaeffer, Parallel sorting by regular sampling, Parallel Distrib. Comput. 14 (4) (1992) 361-372.
23. D.B. Skillicorn, D. Talia, Models and languages for parallel computation, October 1996.
24. V. Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (1969) 354-356.
25. A. Tiskin, The bulk-synchronous parallel random access machine, in: L. Bougé, P. Friagniaud, A. Mignotte, Y. Robert (Eds.), Proc. Euro-Par '96-II, Lecture Notes in Computer Science, vol. 1124, Springer, Berlin, 1996, pp. 327-338.
26. L.G. Valiant, Bulk-synchronous parallel computers, in: M. Reeve (Ed.), Parallel Processing and Artificial Intelligence, Wiley, New York, 1989, Ch. 2, pp. 15-22.
27. L.G. Valiant, A bridging model for parallel computation, Comm. ACM 33 (8) (1990) 103-111.
28. L.G. Valiant, General purpose parallel architectures, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, Ch. 18, pp. 943-971.