Communication complexity of PRAMs
- 1 March 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 71 (1), 3-28
- https://doi.org/10.1016/0304-3975(90)90188-n
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Parallel Merge SortSIAM Journal on Computing, 1988
- Impact of Hierarchical Memory Systems On Linear Algebra Algorithm DesignThe International Journal of Supercomputing Applications, 1988
- A complexity theory of efficient parallel algorithmsLecture Notes in Computer Science, 1988
- Lower bounds on communication complexity in distributed computer networksJournal of the ACM, 1987
- A Communication-Time TradeoffSIAM Journal on Computing, 1987
- Memory requirements for balanced computer architecturesACM SIGARCH Computer Architecture News, 1986
- Parallel Supercomputing Today and the Cedar ApproachScience, 1986
- Information Transfer in Distributed Computing with Applications to VLSIJournal of the ACM, 1984
- Lower Bounds on Information Transfer in Distributed ComputationsJournal of the ACM, 1980
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979