Comparison of Deadlock Recovery and Avoidance Mechanisms to Approach Message Dependent Deadlocks in On-chip Networks

Authors:
Andreas Lankes;Thomas Wild;Andreas Herkersdorf;Soeren Sonntag;Helmut Reinig
Affiliations:
-;-;-;-;-
Venue:
NOCS '10 Proceedings of the 2010 Fourth ACM/IEEE International Symposium on Networks-on-Chip
Year:
2010

Citing 11
Cited 2

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
An efficient, fully adaptive deadlock recovery scheme: DISHA

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Networks on Chips: A New SoC Paradigm

Computer
A Progressive Approach to Handling Message-Dependent Deadlock in Parallel Computer Systems

IEEE Transactions on Parallel and Distributed Systems
Networks on chip

Networks on chip
Performance Evaluation and Design Trade-Offs for Network-on-Chip Interconnect Architectures

IEEE Transactions on Computers
Æthereal Network on Chip: Concepts, Architectures, and Implementations

IEEE Design & Test
A survey of research and practices of Network-on-chip

ACM Computing Surveys (CSUR)
On-Chip Interconnection Architecture of the Tile Processor

IEEE Micro
Deadlock prevention in the ÆTHEREAL protocol

CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods

Benefits of selective packet discard in networks-on-chip

ACM Transactions on Architecture and Code Optimization (TACO)
An energy- and buffer-aware fully adaptive routing algorithm for Network-on-Chip

Microelectronics Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the transition from buses to on-chip networks in SoCs the problem of deadlocks in on-chip interconnects arises. Deadlocks can be caused by routing cycles in the network, or by message dependencies, even if the network itself is actually free of routing cycles. Two basic approaches to counter message dependent deadlocks exist: deadlock avoidance, which is most popular in NoCs, and deadlock recovery, which has until now only been used in parallel computer networks. Deadlock recovery promises low buffer space requirements and does not impose restrictions on connections between individual communication partners. For this study, we have adapted a deadlock recovery scheme for the use in NoCs and compared it to strict ordering as a representative of deadlock avoidance in terms of throughput and buffer space. The results show significant buffer space savings for deadlock recovery, however, at the cost of reduced data throughput.