Loading...
Please wait, while we are loading the content...
Similar Documents
Characterization of Deadlocks in Interconnection Networks (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Warnakulasuriya, Sugath Pinkston, Timothy |
| Description | 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. 1 Introduction Interconnection network routing algorithms aim to minimize message blocking by efficiently utilizing network virtual channel and physical channel resources while ensuring deadlock freedom. Routing approaches to accomplish this can be based on avoiding deadlock or on recovering from deadlock. The main distinction between these two approaches... |
| File Format | |
| Language | English |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Deadlock Freedom Node Degree Deadlock Formation Interconnection Network Message Blocking Virtual Channel Various Design Parameter Main Distinction Resource Dependency Introduction Interconnection Network True Deadlock Detection Algorithm Aim Physical Channel Resource Network Virtual Channel |
| Content Type | Text |
| Resource Type | Article |
