DocumentCode
2480701
Title
Deadlock prevention by turn prohibition in interconnection networks
Author
Levitin, Lev ; Karpovsky, Mark ; Mustafa, Mehmet
Author_Institution
Dept. of Comput. Eng., Boston Univ., Boston, MA, USA
fYear
2009
fDate
23-29 May 2009
Firstpage
1
Lastpage
7
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.
Keywords
graph theory; multiprocessor interconnection networks; SCB algorithm; deadlock prevention; graph theory; interconnection network; simple cycle breaking set; Clustering algorithms; Computer networks; Glass; Multiprocessor interconnection networks; Network topology; Routing; System recovery; Throughput; Tree graphs; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on
Conference_Location
Rome
ISSN
1530-2075
Print_ISBN
978-1-4244-3751-1
Electronic_ISBN
1530-2075
Type
conf
DOI
10.1109/IPDPS.2009.5160898
Filename
5160898
Link To Document