This paper presents a theoretical framework for the design of deadlock-free fully adaptive
routing algorithms for a general class of network topologies and switching techniques in a …

Handling deadlocks is essential for providing reliable communication paths between
processing nodes in parallel computer systems. The existence of multiple message types …

The development of fully adaptive, cut-through (wormhole) networks is important for
achieving high performance in communication-critical parallel processor systems. Increased …

This paper presents a theoretical model of resource allocations and dependencies in
wormhole and virtual cut-through interconnection networks. This model allows various types …

A spate of deadlock avoidance-based and deadlock recovery-based routing algorithms
have been proposed in recent years without full understanding of the likelihood and …

Efficient and reliable communication is essential for achieving high performance in a
networked computing environment. Limited network resources bring about unavoidable …

Efficient and reliable communication is essential for achieving high performance in a
networked computing environment. Finite network resources bring about unavoidable …

In recent years, a large number of deadlock avoidance and recovery-based routing
approaches have been proposed for regular and irregular interconnection networks. These …

Efficient and reliable communication is essential for achieving high performance in
networked computing environments. Limited network resources bring about unavoidable …

相互結合網におけるデッドロック回復方法の分類 Page 1 1. まえがき 並列計算機システムの相互
結合網における問題の一つ に,ルーティングにより発生するデッドロックがある9). 従来,この問題を解決 …