The bulk-synchronous parallel random access machine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1124, Issue , 1996, Pages 327-338

  Tiskin, Alexandre ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FAST FOURIER TRANSFORMS; MEMORY ARCHITECTURE;

BLOCK ALGORITHM; BULK SYNCHRONOUS PARALLEL; DENSE MATRICES; DISTRIBUTED MEMORY;

EQUIVALENCE CLASSES;

EID: 21444432946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024720     Document Type: Conference Paper

References (15)

1. A Aggarwal, A K Chandra, and M Snir. Communication complexity of PRAMs. Theoretical Computer Science, 71:3-28, 1990.
2. C Berge. Graphs, volume 6, part 1 of North-Holland Mathematical Library. North-Holland, second revised edition, 1985.
3. D Coppersmith and S Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
4. T H Cormen, C E Leiserson, and R L Rivest. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. The MIT Press and McGraw-Hill, 1990.
5. A V Gerbessiotis and L G Valiant. Direct bulk-synchronous parallel algorithms. Technical Report TR-10-92 (Extended version), Aiken Computation Laboratory, Harvard University, 1992. Shorter version appears in Proc. 3rd Scandinavian Workshop on Algorithm Theory, July 8-10, 1992, LNCS Vol. 621, pp. 1-18, SpringerVerlag.
6. M Goodrich. Communication-efficient parallel sorting. In Proceedings of the 28th ACM Symp. on Theory of Computing (May 1996).
7. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
8. W F McColl. General purpose parallel computing. In A Gibbons and P Spirakis, editors, Lectures on parallel computation, volume 4 of Cambridge International Series on Parallel Computation, chapter 13, pages 337-391. Cambridge University Press, 1993.
9. W F McColl. Special purpose parallel computing. In A Gibbons and P Spirakis, editors, Lectures on parallel computation, volume 4 of Cambridge International Series on Parallel Computation, chapter 13, pages 261-336. Cambridge University Press, 1993.
10. W F McColl. Scalable computing. In J van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 46-61. Springer-Verlag, 1995.
11. C H Papadimitriou and M Yannakakis. Towards an architecture-independent analysis of parallel algorithms. In Proceedings of the 20th Annual Symposium on Theory of Computing, pages 510-513, 1988.
12. V Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
13. L G Valiant. Bulk-synchronous parallel computers. In M Reeve, editor, Parallel Processing and Artificial Intelligence, chapter 2, pages 15-22. John Wiley & Sons, 1989.
14. L G Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.
15. L G Valiant. General purpose parallel architectures. In J van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 18, pages 943-971. Elsevier, 1990.