Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers
From MaRDI portal
Publication:4714560
DOI10.1137/S0097539794262161zbMath0858.68038OpenAlexW2038387371MaRDI QIDQ4714560
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
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)
Related Items (1)
This page was built for publication: Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers