A universal proof technique for deadlock-free routing in interconnection networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Loren Schwiebert Department of Computer and Information Science, The Ohio State University, Columbus, OH
D. N. Jayasimha Department of Computer and Information Science, The Ohio State University, Columbus, OH
Published in:
Cover Image
 
· Proceeding
SPAA '95 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Pages 175-184
ACM New York, NY, USA ©1995
table of contents ISBN:0-89791-717-0 doi>10.1145/215399.215440
A universal proof technique for deadlock-free routing in interconnection networks Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Downloads (cumulative): 320
· Citation Count: 12


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