loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)
An O(n) Distributed Deadlock Resolution Algorithm
Montb?liard-Sochaux, France
February 15-February 17
ISBN: 0-7695-2513-X
ASCII Text
x 
 
Manuel Prieto, Jesus Villadangos, Federico Farina, Alberto Cordoba, "An O(n) Distributed Deadlock Resolution Algorithm," Parallel, Distributed, and Network-Based Processing, Euromicro Conference on, pp. 48-55, 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/PDP.2006.22,
author = {Manuel Prieto and Jesus Villadangos and Federico Farina and Alberto Cordoba},
title = {An O(n) Distributed Deadlock Resolution Algorithm},
journal ={Parallel, Distributed, and Network-Based Processing, Euromicro Conference on},
volume = {0},
year = {2006},
issn = {1066-6192},
pages = {48-55},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDP.2006.22},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
TI - An O(n) Distributed Deadlock Resolution Algorithm
SN - 1066-6192
SP48
EP55
A1 - Manuel Prieto,
A1 - Jesus Villadangos,
A1 - Federico Farina,
A1 - Alberto Cordoba,
PY - 2006
KW - Distributed systems
KW - Deadlock detection/resolution
KW - Single-resource request model
KW - Distributed algorithms
KW - Complexity.
VL - 0
JA - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
ER -
 
Manuel Prieto, Universidad Publica de Navarra, Spain
Jesus Villadangos, Universidad Publica de Navarra, Spain
Federico Farina, Universidad Publica de Navarra, Spain
Alberto Cordoba, Universidad Publica de Navarra, Spain
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n-1 messages and a latency of n?T for a deadlock cycle of n processes, where T is the inter-site communication delay. The algorithm achieves this improvement even verifying the strongest correctness criteria considered in previous works: it resolves all deadlocks in finite time and does not resolve false deadlocks.
Index Terms:
Distributed systems, Deadlock detection/resolution, Single-resource request model, Distributed algorithms, Complexity.
Citation:
Manuel Prieto, Jesus Villadangos, Federico Farina, Alberto Cordoba, "An O(n) Distributed Deadlock Resolution Algorithm," pdp, pp.48-55, 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.