EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...

The problem of deadlock detection in a distributed system has been extensively studied in the past few years. Many algorithms on distributed deadlock detection have been proposed under the assumption that the processors and communication in the system are fault-free. However, in an unreliable distributed system, faulty processors may prevent a deadlock detection algorithm from properly detectin...

Library writers wish to provide a guarantee not only that each procedure in the library performs correctly in isolation, but also that the procedures perform correctly when run in conjunction. To this end, we propose a method for static detection of deadlock in Java libraries. Our goal is to determine whether client code exists that may deadlock a library, and, if so, to enable the library writ...

Library writers wish to provide a guarantee not only that each procedure in the library performs correctly in isolation, but also that the procedures perform correctly when run in conjunction. To this end, we propose a method for static detection of deadlock in Java libraries. Our goal is to determine whether client code exists that may deadlock a library, and, if so, to enable the library writ...

In the distributed mutual exclusion problem, a set of processes must coordinate their actions so that at any time at most one process may be within its critical section. Information structure distributed mutual exclusion algorithms (ISDME) are instances of a general algorithm which can represent several non-token-based algorithms. This paper introduces a new deadlock-free ISDME algorithm (DF-IS...

Although railway dispatching on large national networks is gradually becoming more computerized, there are still major obstacles to retrofitting (semi-)autonomous control systems. In addition requiring extensive and detailed digitalization of infrastructure models information systems, exact optimization for computationally hard. Heuristic algorithms manual overrides likely be required semi-auto...

One way to specialize a general purpose multi-core chip built using NoC principles is to provide a mechanism to configure an application specific deadlock free routing algorithm in the underlying communication network. A table in every router, implemented using a writable memory, can provide a possibility of specializing the routing algorithm according to the application requirements. In such a...

Second generation multicomputers use wormhole routing, allowing a very low channel setup time and drastically reducing the dependency between network latency and internode distance. Deadlock-free routing strategies have been developed, allowing the implementation of fast hardware routers that reduce the communicat ion bottleneck. Also, adaptive routing algorithms with deadlock-avoidance or dead...

Deadlock-free operation of flexible manufacturing systems (FMSs) is an important goal of manufacturing systems control research. In this work, we develop the criteria that real-time FMS deadlock-handling strategies must satisfy. These criteria are based on a digraph representation of the FMS state space. Control policies for deadlock-free operation are characterized as partitioning cuts on this...