SIGN IN
SIGN UP
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
Full Text:
PDF
Buy this Article
Authors:
Gustavo D. Pifarré
ESLAI, Escuela Superior Latino Americana de Informática, CC 3193, (1000) Buenos Aires, Argentina. and Computer Research and Advanced Applications Group, IBM, Argentina, Ing. E. Butti 275, (13 ...
Luis Gravano
ESLAI, Escuela Superior Latino Americana de Informática, CC 3193, (1000) Buenos Aires, Argentina. and Computer Research and Advanced Applications Group, IBM, Argentina, Ing. E. Butti 275, (13 ...
Sergio A. Felperin
ESLAI, Escuela Superior Latino Americana de Informática, CC 3193, (1000) Buenos Aires, Argentina. and Computer Research and Advanced Applications Group, IBM, Argentina, Ing. E. Butti 275, (13 ...
Jorge L. C. Sanz
Computer Science Dept., IBM Almaden Research Center, San, José, California., Computer Research and Advanced Applications Group, IBM, Argentina, Ing. E. Butti 275, (1300) Buenos Aires, Argenti ...
1991 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 249
· Citation Count: 16
Published in:
· Proceeding
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Pages 278-290
ACM
New York, NY
, USA
©1991
table of contents
ISBN:0-89791-438-4
doi>
10.1145/113379.113405
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
computations on discrete structures
graph algorithms
packet-switching networks
parallel processors
parallelism and concurrency
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