Article

Free access

On communication latency in PRAM computations

Authors:

A. Aggarwal,

A. K. Chandra,

M. SnirAuthors Info & Claims

SPAA '89: Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

Pages 11 - 21

https://doi.org/10.1145/72935.72937

Published: 01 March 1989 Publication History

PDF eReader

References

[1]

[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.

Digital Library

Google Scholar

[2]

[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

[3]

[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.

Digital Library

Google Scholar

[4]

[AS88] W.C. Athas and C.L. Seitz, "Multicomputers: Message-Passing Concurrent Computers," Computer, Vol. 21, No. 8, Aug. 88, pp. 9-25.

Digital Library

Google Scholar

[5]

[Ba88] K.E. Batcher, "Sorting networks and their Applications," Proceedings, AFIPS 32, 1968. pp. 307-314.

Google Scholar

[6]

[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

[7]

[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.

Digital Library

Google Scholar

[8]

[Ch76] A.K. Chandra, "Maximal Parallelism in Matrix Multiplication," IBM Technical Report RC 6193, Sept. 1976.

Google Scholar

[9]

[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.

Digital Library

Google Scholar

[10]

[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

[11]

[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

[12]

[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.

Digital Library

Google Scholar

[13]

[Ka87] A. Karp, "Programming for Parallelism," IEEE Computer, May 1987.

Digital Library

Google Scholar

[14]

[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.

Digital Library

Google Scholar

[15]

[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

[16]

[Le85] T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. on Computers, Vol. C-34, 1985, pp. 965-968.

Digital Library

Google Scholar

[17]

[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

[18]

[PU87] C.H. Papadimitriou and J.D. Ullman, "A Communication-Time Tradeoff," SIAM J. of Computing, Vol. 16, Aug. 1987, pp. 639-647.

Digital Library

Google Scholar

[19]

[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.

Digital Library

Google Scholar

[20]

[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.

Digital Library

Google Scholar

[21]

[RT86] R. Rettberg and R. Thomas, "Contention is No Obstacle to Shared-Memory multiprocessing," Comm. of ACM, 1986, pp. 1202-1212.

Digital Library

Google Scholar

[22]

[Vi83] U. Vishkin, "Implementation of Simultaneous Memory Address Access in Models That Forbid It," J. of Algorithms, Vol. 4, 1983, pp. 45-50.

Crossref

Google Scholar

[23]

[VW83] U. Vishkin and A. Wigderson, "Dynamic Parallel Memories," Information and Control, Vol. 56, 1983, pp. 174-182.

Digital Library

Google Scholar

Cited By

View all

Irmler AKanakagiri ROhlmann SSolomonik EGrüneis A(2023)Optimizing Distributed Tensor Contractions Using Node-Aware Processor GridsEuro-Par 2023: Parallel Processing10.1007/978-3-031-39698-4_48(710-724)Online publication date: 24-Aug-2023
https://doi.org/10.1007/978-3-031-39698-4_48
Besta MCarigiet AJanda KVonarburg-Shmaria ZGianinazzi LHoefler T(2020)High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and QualitySC20: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41405.2020.00103(1-17)Online publication date: Nov-2020
https://doi.org/10.1109/SC41405.2020.00103
Trinder PCole MHammond KLoidl HMichaelson G(2011)Resource analyses for parallel and distributed coordinationConcurrency and Computation: Practice and Experience10.1002/cpe.189825:3(309-348)Online publication date: 22-Dec-2011
https://doi.org/10.1002/cpe.1898
Show More Cited By

Index Terms

On communication latency in PRAM computations

Recommendations

Pram simulations on bounded-degree networks
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

Information & Contributors

Information

Published In

SPAA '89: Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

March 1989

433 pages

ISBN:089791323X

DOI:10.1145/72935

Editor:
F. T. Leighton

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA89

Sponsor:

SPAA89: 1st Annual ACM Symposium on Parallel Algorithms & Architectures

June 18 - 21, 1989

New Mexico, Santa Fe, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

60
Total Citations
View Citations
606
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)4

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Irmler AKanakagiri ROhlmann SSolomonik EGrüneis A(2023)Optimizing Distributed Tensor Contractions Using Node-Aware Processor GridsEuro-Par 2023: Parallel Processing10.1007/978-3-031-39698-4_48(710-724)Online publication date: 24-Aug-2023
https://doi.org/10.1007/978-3-031-39698-4_48
Besta MCarigiet AJanda KVonarburg-Shmaria ZGianinazzi LHoefler T(2020)High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and QualitySC20: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41405.2020.00103(1-17)Online publication date: Nov-2020
https://doi.org/10.1109/SC41405.2020.00103
Trinder PCole MHammond KLoidl HMichaelson G(2011)Resource analyses for parallel and distributed coordinationConcurrency and Computation: Practice and Experience10.1002/cpe.189825:3(309-348)Online publication date: 22-Dec-2011
https://doi.org/10.1002/cpe.1898
Yuan LZhang YTang YRao LSun X(2010)LogGPHProceedings of the 2010 13th IEEE International Conference on Computational Science and Engineering10.1109/CSE.2010.40(268-274)Online publication date: 11-Dec-2010
https://dl.acm.org/doi/10.1109/CSE.2010.40
Li LZhang XFeng JDong X(2010)mPlogPProceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing10.1109/CCGRID.2010.60(679-684)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1109/CCGRID.2010.60
Rauber TRünger GRauber TRünger G(2009)Performance Analysis of Parallel ProgramsParallel Programming10.1007/978-3-642-04818-0_4(151-196)Online publication date: 4-Dec-2009
https://doi.org/10.1007/978-3-642-04818-0_4
Dorrigiv RLópez-Ortiz ASalinger AMeyer auf der Heide FShavit N(2008)Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures10.1145/1378533.1378568(185-187)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1145/1378533.1378568
Zhang YChen GSun GMiao Q(2007)Models of parallel computation: a survey and classificationFrontiers of Computer Science in China10.1007/s11704-007-0016-11:2(156-165)Online publication date: May-2007
https://doi.org/10.1007/s11704-007-0016-1
Bosque JPastor L(2006)A Parallel Computational Model for Heterogeneous ClustersIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2006.16517:12(1390-1400)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.1109/TPDS.2006.165
Chen GSun GZhang YMo Z(2006)Study on Parallel ComputingJournal of Computer Science and Technology10.1007/s11390-006-0665-921:5(665-673)Online publication date: Sep-2006
https://doi.org/10.1007/s11390-006-0665-9
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Pram simulations on bounded-degree networks

Work-Time Optimal k-Merge Algorithms on the PRAM

PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Pram simulations on bounded-degree networks

Work-Time Optimal k-Merge Algorithms on the PRAM

PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations