SIGN IN
SIGN UP
Bounds on the efficiency of message-passing protocols for parallel computers
Full Text:
Pdf
Buy this Article
Authors:
Robert Cypher
IBM Almaden Research Center, San Jose, CA
Smaragda Konstantinidou
IBM Almaden Research Center, San Jose, CA
Published in:
· Proceeding
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Pages 173 - 181
ACM
New York, NY
, USA
©1993
table of contents
ISBN:0-89791-599-2
doi>
10.1145/165231.165253
1993 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 169
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
design
network protocols
parallel processors
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder