In service-oriented architectures (SOA), deadlock-free interaction of services is an important correctness criterion. To support service discovery in an SOA, operating guidelines serve as a structure to characterize all deadlock-freely interacting partners of a services. In practice, however, there are intended and unintended deadlock-freely interacting partners of a service. In this paper, we ...

The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...

This paper focuses on eecient multicasting in wormhole-routed networks. A trip-based model is proposed to support adaptive, distributed, and deadlock-free multiple multicast on any network with arbitrary topology using at most two virtual channels per physical channel. This model signiicantly generalizes the path-based model proposed earlier 21, 22], which works only for Hamiltonian networks an...

Besides respecting prescribed protocols, communication-centric systems should never “get stuck”. This requirement has been expressed by liveness properties such as progress or (dead)lock freedom. Several typing disciplines that ensure these properties for mobile processes have been proposed. Unfortunately, very little is known about the precise relationship between these disciplines–and the cla...

We investigate the foundations of Choreographic Programming, a paradigm for writing concurrent programs that are deadlock free by construction, guided by the notion of computation. We start by introducing Minimal Choreographies (MC), a language that includes only the essential primitives of the paradigm. MC is minimal wrt Turing completeness: it implements all computable functions, and restrict...

A contention-free and deadlock-free unicast based multicast algorithm is developed for star graph interconnection networks. The algorithm is developed recursively, and is based on the hierarchical properties of the star graph. The wormhole communication technique is used, and it is assumed that one input channel can drive only one output channel at a time. I n order to eliminate contention an t...

Similar to the interconnection architectures, deadlock occurs in NoC architectures when a group of packets are unable to make progress because they are waiting on one another to release resources. Despite its effectiveness in reducing buffer requirements,wormhole-switching technique is susceptible to deadlock. In wormhole switching, the resources are virtual channel and their corresponding buff...