Adaptive routing can improve network performance and fault-tolerance by providing multiple routing paths. However, the implementation complexity of adaptive routing can be signiicant, discouraging its use in commercial massively parallel systems. In this paper, we introduce Hierarchical Adaptive Routing (HAR), a new adaptive routing framework, which provides a uni-ed framework for simple and hi...

Csp-Prover provides a deep encoding of the process algebra Csp in the interactive theorem prover Isabelle. Here, we extend Csp-Prover by a framework for the deadlock-analysis of networks. As a typical example we study systolic arrays and prove in Csp-Prover that Kung's classical algorithm for matrix-multiplication is deadlock-free. 1 Introduction Among the various frameworks for the description...

In industrial applications, many systems present serious productivity problems due to limited resources. Generally, the dynamics of resource allocation are inherently discrete-event driven, such as buffer in production line systems. this paper, we develop a mathematical model for optimization. work, consider two crucial optimization objectives, e.g., deadlock-free and efficiency, that originate...

The communicating finite state machines can exchange messages over bounded FIFO channels. In this paper, a new technique, called reverse reachability analysis, is proposed to detect deadlocks on the communication between the communicating finite state machines. The technique is based on finding reverse reachable paths starting from possible deadlock states. If a reverse reachable path can reach...

We have developed a hardware detour path selection facility for the Hitachi SR2201 parallel computer, which uses a multi-dimensional crossbar as an inter-processor network to ensure operating efficiency and high reliability when a part of the network is faulty. When this hardware facility is used, packets are transmitted to their destination along alternative paths to avoid the fault. However, ...

This paper validates and generalises an optimisation arising in the compilation of while loops in data-parallel languages for MIMD shared memory architectures. Dependencies in the source program force the introduction of global synchronisations in the target MIMD program; yet, an eecient compilation must decrease the number of these costly operations. In this context, Hatcher and Quinn have pro...

The classic readers-writers problem has been extensively studied. This holds to a lesser degree for the reentrant version, where it is allowed to nest locking actions. Such nesting is useful when a library is created with various procedures each starting and ending with a lock operation. Allowing nesting makes it possible for these procedures to call each other. We considered an existing widely...

This paper describes a new class of deadlock-free routing algorithms for irregular networks based on ordered links. In this case, the links are ordered by partitioning them into a set of layers, each layer containing a spanning tree (when possible). Deadlock free routes can then be derived by using links with non-decreasing order. The deadlockfreedom property is proved. Two different implementa...