A. Aggarwal
M. Snir
- [AC88] A. Aggarwal and A.K. Chandra, "Communication Complexity of PRAMs," Proc. of the 15th International Coll. on Automata, Languages and Programming, Springer Verlag Lecture Notes in Computer Science, Number 317, July 1988, pp. 1- 18. Google Scholar
Digital Library
- [ACS87] A. Aggarwal, A. Chandra and M. Snir, "Hierarchical memory with Block Transfer," Proc. 28th IEEE Symp, on Foundations of Computer Science, 1987, pp. 204-216.Google Scholar
- [AKS83] M. Ajtai, J. Komlos and E. Szemeredi, "An O(n log n) Sorting Network," Proc. 15th Ann. Symp. on Theory of Computing, 1983, pp. 1-9. Google ScholarDigital Library
- [AS88] W.C. Athas and C.L. Seitz, "Multicomputers: Message-Passing Concurrent Computers," Computer, Vol. 21, No. 8, Aug. 88, pp. 9-25. Google ScholarDigital Library
- [Ba88] K.E. Batcher, "Sorting networks and their Applications," Proceedings, AFIPS 32, 1968. pp. 307-314.Google Scholar
- [BS78] G. Baudet and D. Stevenson, "Optimal Sorting Algorithms for Parallel Computers," IEEE Trans. on Computers, Vol. C-27, No. 1, 1978, pp. 84-87.Google Scholar
- [Ca88] D.A. Calahan, "Performance Evaluation of Static and Dynamic Memory Systems on the CRAY-2," Proc. of the 1988 Int. Conf. on Supercomputing, 1988, pp. 519-524. Google ScholarDigital Library
- [Ch76] A.K. Chandra, "Maximal Parallelism in Matrix Multiplication," IBM Technical Report RC 6193, Sept. 1976.Google Scholar
- [CGBG88] D.R. Cheriton, A. Gupta, P. Boyle, and H. Goosen, "The VMP Multiprocessor: Initial Experience, Refinements and Performance Evaluation," Proc. of the 15th Int. Symp. on Computer Architecture, June 1988, Hawaii. Google ScholarDigital Library
- [Fl72] R.W. Floyd, "Permuting Information in Idealized Two-Level Storage," In R.E. Miller and J. W. Thatcher (editors), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 105-109.Google Scholar
- [GKLS83] D. Gajski, D. Kuck, D. Lawrie, and A. Sameh, "Cedar - a Large Scale Multiprocessor," Proc. of the 1983 Int. Conference on Parallel Processing, 1983, pp. 524-529.Google Scholar
- [HKP84] H.J. Hoover, M.M. Klawe and N.J. Pippenger, "Bounding Fan-out in Logical Networks," J. ACM, Vol. 31, 1984, pp. 13-18. Google ScholarDigital Library
- [Ka87] A. Karp, "Programming for Parallelism," IEEE Computer, May 1987. Google ScholarDigital Library
- [KRS88] C.P. Kruskal, M. Snir, and L. Rudolph, "A Complexity Theory of Efficient Parallel Algorithms," Proc. of 15th Annual Int. Coll on Automata, Languages, and Programming, Springer Verlag Lecture Notes in Computer Science, Vol. 317, July 1988, pp. 333-346. Google ScholarDigital Library
- [KS88] C.P. Kruskal and C.H. Smith, "Definitions of Granularity," Proc. of Int. Symp. on High Performance Computer Systems, Ed. E. Gelenbe, North Holland, Amsterdam, 1988, pp. 257-268.Google Scholar
- [Le85] T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. on Computers, Vol. C-34, 1985, pp. 965-968. Google ScholarDigital Library
- [Pf85] G. Pfister et al. "The IBM Research Parallel Prototype (RP3): Introduction and Architecture," Proc. 1985 Int. Conf. on Parallel Processing, Aug. 1985, pp. 764-771.Google Scholar
- [PU87] C.H. Papadimitriou and J.D. Ullman, "A Communication-Time Tradeoff," SIAM J. of Computing, Vol. 16, Aug. 1987, pp. 639-647. Google ScholarDigital Library
- [PY88] C. Papadimitriou and M. Yannakakis, "Towards an Architecture-Independent Analysis of Parallel Algorithms," Proc. of the 20th Annual ACM Symp. on Theory of Computing, 1988, pp. 510-513. Google ScholarDigital Library
- [RP88] A. Rogers and K. Pingali, "Process Decomposition Through Locality of Reference," Tech. Report TR 88-935, Dept. of Comp. Science, Cornell University, Aug. 1988. Google ScholarDigital Library
- [RT86] R. Rettberg and R. Thomas, "Contention is No Obstacle to Shared-Memory multiprocessing," Comm. of ACM, 1986, pp. 1202-1212. Google ScholarDigital Library
- [Vi83] U. Vishkin, "Implementation of Simultaneous Memory Address Access in Models That Forbid It," J. of Algorithms, Vol. 4, 1983, pp. 45-50.Google ScholarCross Ref
- [VW83] U. Vishkin and A. Wigderson, "Dynamic Parallel Memories," Information and Control, Vol. 56, 1983, pp. 174-182. Google ScholarDigital Library
Index Terms
- On communication latency in PRAM computations
Recommendations
Work-Time Optimal k-Merge Algorithms on the PRAM
For 2 k n, the k-merge problem is to merge a collection of k sorted sequences of total length n into a new sorted sequence. The k-merge problem is fundamental as it provides a common generalization of both merging and sorting. The main contribution of ...
PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms
The problem of dynamic processor allocation in PRAMs (programmable random-access memories) is discussed, and differentiated from that of static allocation. The version of the PRAM considered, also called the CREW model is a parallel computer with global ...
Comments