We study the problem of possible deadlocks in an SCI-interconnect. We show that it is possible to automatically decide whether an SCI-configuration is prone to deadlocks, and we indicate an algorithm that checks this effectively by searching a graph for cycles. Then we present another algorithm that automatically modifies a deadlocking configuration, such that it becomes deadlock free. We apply...

Credit networks rely on decentralized, pairwise trust relationships (channels) to exchange money or goods. arise naturally in many financial systems, including the recent construct of payment channel blockchain systems. An important performance metric for these is their transaction throughput. However, predicting throughput a credit network nontrivial. Unlike traditional communication channels,...

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...

Recently it has been shown that the class of BPA (or context-free) processes can be widely used to describe sequential processes and to define their semantics. This class has been intensively studied. Bisimilarity and regularity appeared to be decidable within the BPA processes (see [CHS95], [BCS96]). We extend these processes with a deadlocking state into BPA systems. We show that the BPA clas...

The description of deadlocks in concurrent programming is translated to conditions on the topology of the progress graph representing the transaction system.

Dynamic network reconfiguration is described as the process of replacing one routing function with another while the network keeps running. The main challenge is avoiding deadlock anomalies while keeping limitations on packet injection and forwarding minimal. Current approaches which have a high complexity and as a result have a limited practical applicability either require the existence of ex...