Deadlock prevention by turn prohibition in interconnection networks

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.

• Type: Conference
• Year: 2009
• Where: IPPS
• Authors: Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
• Keywords: Distributed And Parallel Computing, IPPS 2009, Minimal Cycle-breaking Sets, SCB Algorithm, SCB Algorithm Guarantees