loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing
Knot Resolution Algorithm and its Performance Evaluation
Genova, Italy
February 05-February 07
ISBN: 0-7695-1875-3
J. Villadangos, Universidad P?blica de Navarra
F. Fariña, Universidad P?blica de Navarra
A. Córdoba, Universidad P?blica de Navarra
J.R. González de Mendívil, Universidad P?blica de Navarra
J.R. Garitagoitia, Universidad P?blica de Navarra
Deadlocks in the OR request model are usually resolved by aborting a deadlocked process. The work done by the aborted process is wasted. Therefore, the throughput of a system could be improved ensuring that deadlock resolution algorithms do not cause false deadlock resolutions. This paper presents the performance evaluation of a safe-deadlock resolution algorithm, which has a theoretical communication cost similar to other safe-detection algorithms (which do not consider explicitely deadlock resolution).
Citation:
J. Villadangos, F. Fariña, A. Córdoba, J.R. González de Mendívil, J.R. Garitagoitia, "Knot Resolution Algorithm and its Performance Evaluation," pdp, pp.227, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003
Usage of this product signifies your acceptance of the Terms of Use.