An Initial Performance Study of Scalable Mutual Exclusion Protocols
Abstract
Protocolos de exclusão mútua escaláveis são mecanismos otimizados para gerenciar o acesso exclusivo e concorrente a recursos compartilhados em contexto de alta contenção, onde múltiplas threads competem intensamente pelo mesmo recurso. Este estudo compara o desempenho de alguns desses protocolos contra os não escaláveis, em contexto de alta contenção, agrupados por políticas de espera ativa e passiva.References
Craig, T. (1993). Building fifo and priority-queuing spin locks from atomic swap. Technical report, Technical Report TR 93-02-02, Department of Computer Science, University of Washington.
Dice, D. (2017). Malthusian locks. In Alonso, G., Bianchini, R., and Vukolic, M., editors, Proceedings of the Twelfth European Conference on Computer Systems, EuroSys 2017, Belgrade, Serbia, April 23-26, 2017, pages 314–327. ACM.
Dice, D. and Kogan, A. (2021). Hemlock: Compact and scalable mutual exclusion. In Agrawal, K. and Azar, Y., editors, SPAA ’21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021, pages 173–183. ACM.
Guiroux, H. (2018). Understanding the performance of mutual exclusion algorithms on modern multicore machines. PhD thesis, Université Grenoble Alpes.
Herlihy, M., Shavit, N., Luchangco, V., and Spear, M. (2020). The art of multiprocessor programming. Newnes.
Magnusson, P. S., Landin, A., and Hagersten, E. (1994). Queue locks on cache coherent multiprocessors. In Proceedings of the 8th International Symposium on Parallel Processing, Cancún, Mexico, April 1994, pages 165–171.
Mellor-Crummey, J. M. and Scott, M. L. (1991). Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst., 9(1):21–65.
Scott, M. L. and Brown, T. (2013). Shared-memory synchronization. Springer.
Silberschatz, A., Galvin, P. B., and Gagne, G. (2013). Operating system concepts essentials. Wiley Publishing.
Dice, D. (2017). Malthusian locks. In Alonso, G., Bianchini, R., and Vukolic, M., editors, Proceedings of the Twelfth European Conference on Computer Systems, EuroSys 2017, Belgrade, Serbia, April 23-26, 2017, pages 314–327. ACM.
Dice, D. and Kogan, A. (2021). Hemlock: Compact and scalable mutual exclusion. In Agrawal, K. and Azar, Y., editors, SPAA ’21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021, pages 173–183. ACM.
Guiroux, H. (2018). Understanding the performance of mutual exclusion algorithms on modern multicore machines. PhD thesis, Université Grenoble Alpes.
Herlihy, M., Shavit, N., Luchangco, V., and Spear, M. (2020). The art of multiprocessor programming. Newnes.
Magnusson, P. S., Landin, A., and Hagersten, E. (1994). Queue locks on cache coherent multiprocessors. In Proceedings of the 8th International Symposium on Parallel Processing, Cancún, Mexico, April 1994, pages 165–171.
Mellor-Crummey, J. M. and Scott, M. L. (1991). Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst., 9(1):21–65.
Scott, M. L. and Brown, T. (2013). Shared-memory synchronization. Springer.
Silberschatz, A., Galvin, P. B., and Gagne, G. (2013). Operating system concepts essentials. Wiley Publishing.
Published
2025-05-28
How to Cite
FEDRICCI, Pedro de Matos; BIANCHINI, Calebe de Paula.
An Initial Performance Study of Scalable Mutual Exclusion Protocols. In: REGIONAL SCHOOL OF HIGH PERFORMANCE COMPUTING FROM SÃO PAULO (ERAD-SP), 16. , 2025, São José do Rio Preto/SP.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2025
.
p. 34-37.
DOI: https://doi.org/10.5753/eradsp.2025.9724.
