Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:4714560
Jump to:navigation, search

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



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)



Related Items (1)

Parallel algorithms for gossiping by mail





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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4714560&oldid=18954330"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 21:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki