We present an adaptation of the Naïmi-Tréhel mutual exclusion algorithm to manage a prioritized access to a shared resource. Each resource request has a priority level, and is recorded in a global distributed queue. The distributed queue scheduling needs a modification of the algorithm data structures, additional messages between requesting sites (users), and request mobility between requesting sites. © Springer-Verlag 2003.
CITATION STYLE
Housni, A., Lacroix, M., & Trehel, M. (2004). Distributed scheduling of mobile priority requests. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 669–674. https://doi.org/10.1007/978-3-540-45209-6_94
Mendeley helps you to discover research relevant for your work.