Adaptive Register Allocation with a Linear Number of Registers

Abstract : We give an adaptive algorithm in which processes use multi-writer multi-reader registers to acquire exclusive write access to their own single-writer, multi-reader registers. It is the first such algorithm that uses a number of registers linear in the number of participating processes. Previous adaptive algorithms require at least Θ(n 3/2) registers.
Type de document :
Communication dans un congrès
Yehuda Afek. DISC 2013 - 27th International Symposium Distributed Computing, Oct 2013, Jerusalem, Israel. Springer, 8205, pp.269-283, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-41527-2_19〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00922425
Contributeur : Carole Delporte-Gallet <>
Soumis le : jeudi 26 décembre 2013 - 15:57:08
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

Lien texte intégral

Identifiants

Collections

Citation

Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Leslie Lamport. Adaptive Register Allocation with a Linear Number of Registers. Yehuda Afek. DISC 2013 - 27th International Symposium Distributed Computing, Oct 2013, Jerusalem, Israel. Springer, 8205, pp.269-283, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-41527-2_19〉. 〈hal-00922425〉

Partager

Métriques

Consultations de la notice

207