In [1], Libeskind-Hadas recently provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithm. Given an interconnection network represented by a digraph G = (N;C), where each vertex in N represents a node and each directed link in C represents a unidirectional channel, Libeskind-Hadas showed that jCj 2jN j 2 is the tight lowered on...

A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical ow of information inside a proof, that is, roughly, a distribut...

Hypercycles. is a class of multidimensional graphs, which are generalizations of the n-cube. They are obtained by allowing each dimension to incoIporate more than two elements and a cyclic interconnection strategy. Hypercycles, can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application. Routing strategies, incl...

We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not dead). Our representation is an extension of the existing notion of an operating guideline which only cared about deadlock freedom. We further present an algorithm to decide whether a service M matches with the extende...

Modern multiprocessor architectures have exacerbated problems of coordinating access to shared data, in particular as regards to the possibility of deadlock. For example semaphores, one of the most basic synchronization primitives, present difficulties. Djikstra defined semaphores to solve the problem of mutual exclusion. Practical implementation of the concept has, however, produced semaphores...

Modern multiprocessor architectures have exacerbated problems of coordinating access to shared data, in particular as regards to the possibility of deadlock. For example semaphores, one of the most basic synchronization primitives, present difficulties. Djikstra defined semaphores to solve the problem of mutual exclusion. Practical implementation of the concept has, however, produced semaphores...

Java may used to develop code for life-, safety-, and mission-critical embedded systems; multithreaded applications must be free from deadlock and livelock. These problems can be eliminated by basing designs on the structures and formalisms of Hoare's Communicating Sequential Processes (CSP). Java class libraries supporting CSP constructs now allow programmers to take advantage of these methods...