The efficiency of greedy routing in hypercubes and butterflies

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: George D. Stamoulis Laboratory for Information and Decisions Systems, Massachusetts Institute of Technology, Cambridge, Mass
John N. Tsitsiklis Laboratory for Information and Decisions Systems, Massachusetts Institute of Technology, Cambridge, Mass
Published in:
· Proceeding
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Pages 248-259
ACM New York, NY, USA ©1991
table of contents ISBN:0-89791-438-4 doi>10.1145/113379.113402
The efficiency of greedy routing in hypercubes and butterflies Published by ACM 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 243
· Citation Count: 21


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder