Referenced Items are not available for this document.
This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-recovery which relaxes the sequential recovery requirement for simultaneous recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks
Published in:
Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
Date of Conference: 15-19 Apr 1996
- Page(s):
- 815 - 821
- Meeting Date :
- 15 Apr 1996-19 Apr 1996
- Print ISBN:
- 0-8186-7255-2
- INSPEC Accession Number:
- 5309807
- Conference Location :
- Honolulu, HI
- Digital Object Identifier :
- 10.1109/IPPS.1996.508153
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
