Characterization of deadlocks in interconnection networks

Author

Warnakulasuriya, Sugath ; Pinkston, Timothy Mark

Author_Institution

Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA

fYear

1997

fDate

1-5 Apr 1997

Firstpage

80

Lastpage

86

Abstract

Deadlock-free routing algorithms have been developed recently without fully understanding the frequency and characteristics of deadlocks. Using a simulator capable of true deadlock detection, we measure a network´s susceptibility to deadlock due to various design parameters. The effects of bidirectionality, routing adaptivity, virtual channels, buffer size and node degree on deadlock formation are studied. In the process, we provide insight into the frequency and characteristics of deadlocks and the relationship between routing flexibility blocked messages, resource dependencies and the degree of correlation needed to form deadlock

Keywords

multiprocessor interconnection networks; performance evaluation; bidirectionality; buffer size; deadlock formation; deadlock-free routing algorithms; deadlocks characterisation; design parameters; interconnection networks; node degree; resource dependencies; routing adaptivity; routing flexibility blocked messages; simulator; true deadlock detection; virtual channels; Engineering profession; Frequency; HTML; Intelligent networks; Multiprocessor interconnection networks; Pattern analysis; Resource management; Routing; System recovery; Virtual colonoscopy;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1997. Proceedings., 11th International

Conference_Location

Genva

ISSN

1063-7133

Print_ISBN

0-8186-7793-7

Type

conf

DOI

10.1109/IPPS.1997.580852

Filename

580852