Deadlock prevention by turn prohibition in interconnection networks

Authors:
Lev Levitin;Mark Karpovsky;Mehmet Mustafa
Affiliations:
Dept. of Computer Engineering, Boston University, MA 02215, USA;Dept. Computer Engineering, Boston University, MA 02215, USA;Dept. of Computer Engineering, Boston University, MA 02215, USA
Venue:
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Year:
2009

Citing 0
Cited 1

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

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks in the networks. We present a new cycle-breaking algorithm called Simple Cycle-Breaking or SCB algorithm that is considerably simpler than earlier algorithms. The SCB algorithm guarantees that the fraction of prohibited turns does not exceed 1/3. Experimental simulation results for the SCB algorithm are shown.