Paper Info
Title
Wormhole Deadlock Prediction
Abstract
Deadlock prevention is usually realized by imposing strong restrictions on packet transmissions in the network so that the resulting deadlock free routing algorithms are not optimal with respect to resources utilization. Optimality request can be satisfied by forbidding transmissions only when they would bring the network into a configuration that will necessarily evolve into a deadlock. Hence, optimal deadlock avoidance is closely related to deadlock prediction. In this paper it is shown that wormhole deadlock prediction is an hard problem. Such result is proved with respect to both static and dynamic routing.
Year
DOI
Venue
2000
10.1007/BFb0002733
Parallel Processing Letters
Keywords
DocType
Volume
wormhole deadlock prediction,dynamic routing,resource utilization,satisfiability
Journal
10
Issue
ISBN
Citations 
4
3-540-63440-1
2
PageRank 
References 
Authors
0.40
8
1
Name
Order
Citations
PageRank
Miriam di Ianni114417.27