The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2003 vol.29)
pp: 608-622
Jes? Villadangos , IEEE Computer Society
Jos? Ram? Gonz?lez de Mend?vil , IEEE Computer Society
ABSTRACT
<p><b>Abstract</b>—Deadlocks in the OR model are usually resolved by aborting a deadlocked process. Prior algorithms for the same model sometimes abort nodes needlessly wasting computing resources. This paper presents a new deadlock resolution algorithm for the OR model that satisfies the following correctness criteria: (<it>Safety</it>) the algorithm does not resolve false deadlocks; (<it>Liveness</it>) the algorithm resolves all deadlocks in finite time. The communication cost of the algorithm is similar to that of previous nonsafe proposals. The theoretical cost has been validated by simulation. In addition, different algorithm initiation alternatives have been analyzed in order to reduce the latency of deadlocks.</p>
INDEX TERMS
Deadlock detection/resolution, OR request model, distributed systems, distributed algorithms.
CITATION
Jes? Villadangos, Federico Fari?, Jos? Ram? Gonz?lez de Mend?vil, Jos? Ram? Garitagoitia, Alberto C?rdoba, "A Safe Algorithm for Resolving OR Deadlocks", IEEE Transactions on Software Engineering, vol.29, no. 7, pp. 608-622, July 2003, doi:10.1109/TSE.2003.1214325
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool