Article

Free access

Optimal broadcast and summation in the LogP model

Authors:

Richard M. Karp,

Abhijit Sahay,

Eunice E. Santos,

Klaus Erik SchauserAuthors Info & Claims

SPAA '93: Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures

Pages 142 - 153

https://doi.org/10.1145/165231.165250

Published: 01 August 1993 Publication History

PDF eReader

References

[1]

A. Aggarwai, A. K. Claandra, and M. Snir. On Communication Latency in PRAM Computation. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 11-2 I. ACM, June 1989.

Digital Library

Google Scholar

[2]

A. Aggarwal, A. K. Claandra, and M. Snir. Communication Complexity of PRAMs. Theoretical Computer Science, pages 3-28, March 1990.

Digital Library

Google Scholar

[3]

lx/. Alon, A. Barak, and U. Manber. On disseminating infomation reliably without broadcasting. In Proceedings of the International Conference on Distributed Computing Systems, 1987.

Google Scholar

[4]

A. Bar-Noy and S. IZipnis. Broadcasting Multiple Messages in Simultaneous Send/Receive Systems. Technical Report NO. RC 18352, IBM Research Division, September 1992. Also to appear in Discrete Applied Mathematics.

Google Scholar

[5]

A.Bar-Noy and S. Kipnis. Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 11-22, June 1992.

Digital Library

Google Scholar

[6]

A. Bar-Noy and S. K.ipnis. Multiple Message Broadcasting in the Postal Model. In Proceedings of the Seventh International Parallel Processing Symposium, April 1993.

Digital Library

Google Scholar

[7]

D.P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: NumericaI Methods. Prentice-Hall, 1989.

Digital Library

Google Scholar

[8]

E. Cockayne and A. Thomason. Optimal muhi-message broadcasting in complete graphs. In Proceedings of the ;Ilth SE Conference on Combinawrics, Graph Theory, and Computing, pages 181-199, 1980.

Google Scholar

[9]

D. E. Culler, R. M. Karp, D. A. Patterson, A. Sahay, K. E. Schauser, # Santos, R. Subramonian, and T. yon Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993. Also appears as TR No. UCB/CS/92 713.

Digital Library

Google Scholar

[10]

A. M. Farley. Broadcast time in communication networks. SIAMJournalonAppliedMathematics, 39(2):385--390, October 1980.

Google Scholar

[11]

S. Fortune and J. Wyllie. Parallelism in Random Access Machines. In Proceedings of the } Oth Annual SympoMum on Theory of Computing, pages 114--118, 1978.

Digital Library

Google Scholar

[12]

S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman. A Survey of Gossiping and Broadcasting in Communication Networks. Networks, 18(4):319-349,1988,

Crossref

Google Scholar

[13]

C-T. Ho. Optimal Comunication Primitives and Graph Erabeddings on Hypereubcs. Ph,D. Thesis, Yale University 1990.

Digital Library

Google Scholar

[14]

C-T. Ho and S.L. Johnsson. Distributed routing algorithms for broadcasting and personalized communication in hypercubes. In Proceedings of the 2986 International Conference on Parallel Processing, pages 640-648. # Computer Society, 1986.

Google Scholar

[15]

1L M. Karp, M. Luby, and F. Meyer auf der Heide, Efficient PRAM Simulation on a Distributed Memory Machine. In Proceedings of the Twenty-Fourth Annual ACM Symposium of the Theory of Computing, pages 318-326, ACM, ACM, May 1992.

Digital Library

Google Scholar

[16]

K. Mehlhom and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339-374, 1984.

Digital Library

Google Scholar

[17]

C. H. Papadimitriou and M. Yannakakis. Towards an Architecture-Independent Analysis of Parallel Algorithms. In Proceedings of the Twentieth Annual ACM Symposium of the Theory of Computing, pages 510-513. ACM, 1988.

Digital Library

Google Scholar

[18]

L. G. Valiant. A Bridging Model for Parallel Computation. Communications of the Association for Computing Machinery, 33(8):103--I I, August 1990.

Digital Library

Google Scholar

Cited By

View all

Hegde Pde Veciana G(2024)Optimal Aggregation via Overlay Trees: Delay-MSE Tradeoffs under FailuresProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/37004238:3(1-37)Online publication date: 10-Dec-2024
https://dl.acm.org/doi/10.1145/3700423
Di Girolamo SDe Sensi DTaranov KMalesevic MBesta MSchneider TKistler SHoefler T(2022)Building Blocks for Network-Accelerated Distributed File SystemsSC22: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41404.2022.00015(1-14)Online publication date: Nov-2022
https://doi.org/10.1109/SC41404.2022.00015
Traff J(2022)Fast(er) Construction of Round-optimal $n$-Block Broadcast Schedules2022 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/CLUSTER51413.2022.00028(142-151)Online publication date: Sep-2022
https://doi.org/10.1109/CLUSTER51413.2022.00028
Show More Cited By

Index Terms

Optimal broadcast and summation in the LogP model

Recommendations

Optimal Broadcast and Summation in the LogP Model
Optimal broadcast for fully connected processor-node networks

We develop and implement an optimal broadcast algorithm for fully connected processor networks under a bidirectional communication model in which each processor can simultaneously send a message to one processor and receive a message from another, ...
Summation formulae for finite cotangent sums

Recently, a half-dozen remarkably general families of the finite trigonometric sums were summed in closed-form by choosing a particularly convenient integration contour and making use of the calculus of residues. In this sequel, we show that this ...

Comments

Information & Contributors

Information

Published In

SPAA '93: Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures

August 1993

399 pages

ISBN:0897915992

DOI:10.1145/165231

Chairman:
Lawrence Snyder

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 August 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

5SPAA93

Sponsor:

European Comp Soc
SIGACT
SIGARCH

5SPAA93: 1993 5th Annual ACM Symposium on Parallel

June 30 - July 2, 1993

Velen, Germany

Acceptance Rates

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

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

127
Total Citations
View Citations
898
Total Downloads

Downloads (Last 12 months)184
Downloads (Last 6 weeks)35

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hegde Pde Veciana G(2024)Optimal Aggregation via Overlay Trees: Delay-MSE Tradeoffs under FailuresProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/37004238:3(1-37)Online publication date: 10-Dec-2024
https://dl.acm.org/doi/10.1145/3700423
Di Girolamo SDe Sensi DTaranov KMalesevic MBesta MSchneider TKistler SHoefler T(2022)Building Blocks for Network-Accelerated Distributed File SystemsSC22: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41404.2022.00015(1-14)Online publication date: Nov-2022
https://doi.org/10.1109/SC41404.2022.00015
Traff J(2022)Fast(er) Construction of Round-optimal $n$-Block Broadcast Schedules2022 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/CLUSTER51413.2022.00028(142-151)Online publication date: Sep-2022
https://doi.org/10.1109/CLUSTER51413.2022.00028
Margolin ABarak A(2020)Tree‐based fault‐tolerant collective operations for MPIConcurrency and Computation: Practice and Experience10.1002/cpe.582633:14Online publication date: 15-Jun-2020
https://doi.org/10.1002/cpe.5826
Küttler MPlaneta MBierbaum JWeinhold CHärtig HBarak AHoefler THollingsworth JKeidar I(2019)Corrected trees for reliable group communicationProceedings of the 24th Symposium on Principles and Practice of Parallel Programming10.1145/3293883.3295721(287-299)Online publication date: 16-Feb-2019
https://dl.acm.org/doi/10.1145/3293883.3295721
Gerstenberger RBesta MHoefler T(2018)Enabling highly scalable remote memory access programming with MPI-3 one sidedCommunications of the ACM10.1145/326441361:10(106-113)Online publication date: 26-Sep-2018
https://dl.acm.org/doi/10.1145/3264413
Kuban RRotta RNolte J(2018)Help Your Busy Neighbors: Dynamic Multicasts over Static TopologiesEuro-Par 2017: Parallel Processing Workshops10.1007/978-3-319-75178-8_51(636-647)Online publication date: 8-Feb-2018
https://doi.org/10.1007/978-3-319-75178-8_51
Ramos SHoefler T(2016)Cache Line Aware Algorithm Design for Cache-Coherent ArchitecturesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2016.251654027:10(2824-2837)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1109/TPDS.2016.2516540
Marendic PLemeire JVucinic DSchelkens P(2016)A novel MPI reduction algorithm resilient to imbalances in process arrival timesThe Journal of Supercomputing10.1007/s11227-016-1707-x72:5(1973-2013)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1007/s11227-016-1707-x
Ramos SHoefler TKielmann THildebrand DTaufer M(2015)Cache Line Aware Optimizations for ccNUMA SystemsProceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing10.1145/2749246.2749256(85-88)Online publication date: 15-Jun-2015
https://dl.acm.org/doi/10.1145/2749246.2749256
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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