Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers

DOI10.1137/S0097539794262161MaRDI QIDQ4714560zbMATH OpenOpenAlexFDO

Authors Robert Cypher, Smaragda Konstantinidou

Publication date 7 November 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539794262161

zbMATH Keywords

parallel computersmessage-passing protocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• Efficient Schemes for Parallel Communication
• scientific article; zbMATH DE number 861430
• Efficient parallel prefix algorithms on multiport message-passing systems
• scientific article; zbMATH DE number 1760111

Cited in

(7)

• Tree search on an atomic model for message passing
• Parallel algorithms for gossiping by mail
• On the complexity of buffer allocation in message passing systems
• A permutation parallel algorithm under exchange restriction with message passing interface
• Modeling and evaluation of a new message-passing system for parallel multiprocessor systems
• On the interconnection of message passing systems
• On further reducing the cost of parallel pipelined message broadcasts

This page was built for publication: Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4714560)