Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Housni, A.: L’exclusion mutuelle entre les membres de deux groupes structurés de téléconférenciers. In: Hermes (ed.) revue RSRCP (Réseaux et Systèmes Répartis, Calculateurs Parallèles), vol. 12(5–6), pp. 565–592 (2000)
Naïmi, M., Tréhel, M., Arnold, A.: A O(log(n)) distributed mutual exclusion algorithm based on path reversal. Parallel and distributed computing 34, 1–13 (1996)
Mueller, F.: Prioritized Token-Based Mutual Exclusion for Distributed Systems. In: Workshop on Parallel and Distributed Real-Time Systems, April 1997, pp. 72–80 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Housni, A., Lacroix, M., Trehel, M. (2003). Distributed Scheduling of Mobile Priority Requests. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds) Euro-Par 2003 Parallel Processing. Euro-Par 2003. Lecture Notes in Computer Science, vol 2790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45209-6_94
Download citation
DOI: https://doi.org/10.1007/978-3-540-45209-6_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40788-1
Online ISBN: 978-3-540-45209-6
eBook Packages: Springer Book Archive