This paper concentrates on a routing algorithm that is adaptive and avoids deadlocks and starvation. It is a general store-and-forward packet router that has been developed to be used as part of a distributed runtime system for Concurrent Clean, an experimental, lazy, higher-order parallel functional programming language based on term graph rewriting. The routing algorithm is based on the one u...

Routing algorithms used in wormhole switched networks must all provide a solution to the deadlock problem. If the routing algorithm allows deadlock cycles to form, then it must provide a deadlock recovery mechanism. Because deadlocks are anomalies that occur while routing, the deadlock recovery mechanism should not allocate any expensive hardware resources for the sake of handling such a rare e...

The use of locks on objects to enforce correct scheduling of concurrent transactions gives rise to deadlock situations. We propose and prove correct a distributed algorithm for detection and resolutions of resource deadlocks in object-oriented distributed systems. In particular, the algorithm can be used in conjunction with concurrency control algorithms which are based on the semantic lock mod...

We present a novel scalable deadlock analyser L2D2 capable of handling C code with low-level unstructured lock manipulation. runs along the call tree program, starting from its leaves, and analyses each function just once, without any knowledge context. builds summaries recording information about locks that are assumed or known to be locked unlocked at entry, inside, exit functions, together d...

RIDL (release of insects with dominant lethality) and Wolbachia are 2 potentially powerful tools in the fight against Zika, but their technological advancement is being hampered by policy barriers. In this study, we discuss what could be done to overcome these regulatory deadlocks.

We propose a system for executing transactions on top of structured peer-topeer networks. Our system guarantees most properties usually expected from transactions, namely atomicity, independance, and consistency. The system is based on distributed locking, with a fully decentralized management. It avoids deadlocks and starvation by assigning priorities to transactions.

A deadlock occurs when there is a cycle of processes waiting for the resources held by others. This deadlock can be resolved only when the cycle is broken i.e. when one of the processes is victimized. None of the previous resolution algorithms choose a victim based on the work done by it before it is aborted. When it aborts, it cancels its pending requests and releases all the resources it had....