DocumentCode :
2635026
Title :
DISHA: a deadlock recovery scheme for fully adaptive routing
Author :
Anjan, K.V. ; Pinkston, Timothy Mark
Author_Institution :
Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
fYear :
1995
fDate :
25-28 Apr 1995
Firstpage :
537
Lastpage :
543
Abstract :
This paper presents a simple method of implementing an efficient and cost effective routing scheme. The strategy considers deadlock recovery as opposed to prevention to optimize performance in the absence of deadlocks. Cycles are broken by re-routing a blocked packet through a deadlock-free lane which is implemented as a central “floating” buffer. The proposed scheme is extremely simple, ensuring quick recovery from deadlocks and enabling the design of fast routers
Keywords :
computational complexity; multiprocessor interconnection networks; performance evaluation; DISHA; deadlock recovery scheme; fast routers; fully adaptive routing; performance; Communication switching; Costs; HTML; Hardware; Heuristic algorithms; Multiprocessor interconnection networks; Routing; Spine; System performance; System recovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1995. Proceedings., 9th International
Conference_Location :
Santa Barbara, CA
Print_ISBN :
0-8186-7074-6
Type :
conf
DOI :
10.1109/IPPS.1995.395983
Filename :
395983
Link To Document :
بازگشت