A simple and efficient deadlock recovery scheme for wormhole routed 2-dimensional meshes
Resource
Dependable Computing, 1999. Proceedings. 1999 Pacific Rim International Symposium on
Journal
Pacific Rim International Symposium o Dependable Computing, 1999
Pages
-
Date Issued
1999-12
Date
1999-12
Author(s)
DOI
N/A
Abstract
In order to avoid deadlocks, prevention-based routing algorithms impose certain routing restrictions which lead to high hardware complexity or low adaptability. If deadlock occurrences are extremely rare, recovery-based routing algorithms become more attractive with respect to hardware complexity and routing adaptability. A simple architecture where each router is provided with an additional special flit buffer was developed to achieving deadlock recovery. Disha-SEQ and Disha-CON are two deadlock recovery schemes based on such an architecture to accomplish sequential recovery and concurrent recovery, respectively. In this paper, we propose a simple recovery scheme for a 2D mesh with the same router architecture, and reduce drawbacks in Disha-SEQ or Disha-CON, such as hardwired tokens, finding the Hamiltonian cycle, Hamiltonian path labeling for each node, and non-minimal path routing. Moreover, the simulation results show that the proposed scheme has a similar performance to Disha-CON and is better than Disha-SEQ. © 1999 IEEE.
Other Subjects
Computer architecture; Hamiltonians; Hardware; Network architecture; 2d meshes; Deadlock recovery; Hamiltonian cycle; Hamiltonian path; Hardware complexity; Minimal path; Recovery scheme; Router architecture; Recovery
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00816231.pdf
Size
104.08 KB
Format
Adobe PDF
Checksum
(MD5):8bf0730286964e25374530e43075a5fd