A fundamental issue in the development of concurrent programs is the resource allocation problem. Roughly speaking, it consists of providing some mechanism to avoid race conditions in the access of shared resources by two or more concurrent processes. For such a task, maybe the most widely mechanism consists of using critical sections. Unfortunately, it is also widely-known that programs which ...

This paper presents a framework to design fully-adaptive, deadlock-free wormhole algorithms for a variety of network topologies. The main theoretical contributions are (a) design of new wormhole algorithms using store-and-forward algorithms, (b) a sufficient condition for deadlock free routing by the wormhole algorithms so designed, and (c) a sufficient condition for deadlock free routing by th...

The existing algorithms for deadlock-free multicasting in interconnection networks assume the Hamiltonian property in the networks topology. However, these networks fail to be Hamiltonian in the presence of faults. This paper investigates the use of Euler circuits in deadlock-free multicasting. Not only are Euler circuits known to exist in all connected networks, a fast polynomial-time algorith...

In this paper, we propose a deadlock-free wormhole routing scheme called the Zigzag routing for the panMesh, which generalizes the mesh topology. Accordingly, we prove that only two virtual channels are needed for deadlock-freeness on every physical channel by using the Zigzag routing.

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in 11, 14]. This theory supplies the suu-cient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies have been proposed. Multicast communication refers to the delivery of the same message...

24 electronic LAN, OCI and the bidirectional shuuenet. One important advantage of the last solution (over the previous two) is that it allows the independent choice of the most cost eeective deadlock free routing scheme for each level of the SSN architecture. 8 Conclusions Deadlocks in wormhole routing networks occur when a state is reached such that no messages can be forwarded towards their d...

This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-recovery which relaxes the sequential recovery requirement for simultaneous recovery from deadlocks. The proposed extension to Disha does not necessitate any additional res...