Deadlock prevention by turn prohibition in interconnection networks

Levitin, Lev B.; Karpovsky, Mark G.; Mustafa, Mehmet

doi:10.1109/ipdps.2009.5160898

Cited by 4 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The concept of deadlock and its close relative, that of livelock, have been widely investigated in various branches of computer science [1], in particular with regards to networking routing [10,15]. Our research focuses on deadlock and livelock prevention in resource co-allocation.…”

Section: Related Workmentioning

confidence: 99%

An Improved Protocol for Deadlock and Livelock Avoidance Resource Co-allocation in Network Computing

Cao

2010

World Wide Web

View full text Add to dashboard Cite

A multitude of applications require simultaneous access to multiple kinds of resources scatted in distributed sites. This problem is known as resource co-allocation which has evolved as a hot topic in network computing. How to design a kind of highperformance protocol for deadlock and livelock avoidance resource co-allocation becomes a challenging problem. In this paper, we propose a new protocol OODP 3 (Optimal ODP 3 ) which is based on the currently popular protocol ODP 3 (Order-based Deadlock Prevention Protocol with Parallel requests).OODP 3 not only inherits the advantage of ODP 3 but also guarantees the fulfillment of resource co-allocation within polynomial time. Theoretical proof is conducted to verify the correctness of OODP 3 . Experimental results also show that OODP 3 achieves the better performance improvements than the existing deadlock and livelock avoidance protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

An Improved Protocol for Deadlock and Livelock Avoidance Resource Co-allocation in Network Computing

Cao

2010

World Wide Web

View full text Add to dashboard Cite

show abstract

Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies

Karpovsky

Levitin

Mustafa

2014

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

Deadlock Prevention with Wormhole Routing

Levitin

Karpovsky

Mustafa

2013

Advances in Systems Analysis, Software Engineering, and High Performance Computing

View full text Add to dashboard Cite

The problem of preventing deadlocks and livelocks in computer communication networks with wormhole routing is considered. The method to prevent deadlocks is to prohibit certain turns (i.e., the use of certain pairs of connected edges) in the routing process, in such a way that eliminates all cycles in the graph. A new algorithm that constructs a minimal (irreducible) set of turns that breaks all cycles and preserves connectivity of the graph is proposed and analyzed. The algorithm is tree-free and is considerably simpler than earlier cycle-breaking algorithms. The properties of the algorithm are proven, and lower and upper bounds for minimum cardinalities of cycle-breaking connectivity preserving sets for graphs of general topology, as well as for planar graphs, are presented. In particular, the algorithm guarantees that not more than 1/3 of all turns in the network become prohibited. Experimental results are presented on the fraction of prohibited turns, the distance dilation, as well as on the message delivery times and saturation loads for the proposed algorithm in comparison with known tree-based algorithms. The proposed algorithm outperforms the tree-based algorithms in all characteristics that were considered.

show abstract

Deadlock prevention by turn prohibition in interconnection networks

Cited by 4 publications

References 13 publications

An Improved Protocol for Deadlock and Livelock Avoidance Resource Co-allocation in Network Computing

An Improved Protocol for Deadlock and Livelock Avoidance Resource Co-allocation in Network Computing

Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies

Deadlock Prevention with Wormhole Routing

Contact Info

Product

Resources

About