A fair starvation-free prioritized mutual exclusion algorithm for distributed systems - Archive ouverte HAL Access content directly
Journal Articles Journal of Parallel and Distributed Computing Year : 2015

A fair starvation-free prioritized mutual exclusion algorithm for distributed systems

Abstract

Several distributed mutual exclusion algorithms define the order in which requests are satisfied based on the priorities assigned to requests. These algorithms are very useful for real-time applications ones or those where priority is associated to a quality of service requirement. However, priority based strategies may result in starvation problems where high priority requests forever prevent low priority ones to be satisfied. To overcome this problem, many priority-based algorithms propose to gradually increase the priority of pending requests. The drawback of such an approach is that it can violate priority-based order of requests leading to priority inversion. Therefore, aiming at minimizing the number of priority violations without introducing starvation, we have added some heuristics in Kanrar-Chaki priority-based token-oriented algorithm in order to slow down the frequency with which priority of pending requests is increased. Performance evaluation results confirm the effectiveness of our approach when compared to both the original Kanrar-Chaki and Chang's priority-based algorithms.
Fichier principal
Vignette du fichier
JPDC-2014.pdf (1.34 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01178757 , version 1 (20-07-2015)

Identifiers

Cite

Jonathan Lejeune, Luciana Arantes, Julien Sopena, Pierre Sens. A fair starvation-free prioritized mutual exclusion algorithm for distributed systems. Journal of Parallel and Distributed Computing, 2015, 83, pp.13-29. ⟨10.1016/j.jpdc.2015.04.002⟩. ⟨hal-01178757⟩
307 View
493 Download

Altmetric

Share

Gmail Facebook X LinkedIn More