Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing (2003)
Feb. 5, 2003 to Feb. 7, 2003
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).
J. Villadangos, A. Córdoba, J. González de Mendívil, F. Fariña and J. Garitagoitia, "Knot Resolution Algorithm and its Performance Evaluation," Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing(PDP), Genova, Italy, 2003, pp. 227.