Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency
2010 (English)In: Proceedings of the 14th International Conference on Principles of Distributed Systems (OPODIS) 2010 / [ed] Chenyang Lu, Toshimitsu Masuzawa, Mohamed Mosbah, Springer , 2010, p. 302-317Conference paper, Published paper (Refereed)
Abstract [en]
A lock-free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak memory models. It has been designed to be cache-aware and work directly on weak memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-free memory management scheme to decrease unnecessary synchronization and increase performance. Experiments on an 8-way multi-core platform show significantly better performance for the new algorithm compared to previous fast lock-free algorithms.
Place, publisher, year, edition, pages
Springer , 2010. p. 302-317
Keywords [en]
lock-free, data structure, synchronization, shared memory, queue, concurrent queue, fifo queue, Parallel Programming
National Category
Computer Sciences Computer and Information Sciences
Identifiers
URN: urn:nbn:se:hb:diva-6460DOI: 10.1007/978-3-642-17653-1_23Local ID: 2320/7291ISBN: 978-3-642-17652-4 (print)ISBN: 3-642-17652-6 (print)OAI: oai:DiVA.org:hb-6460DiVA, id: diva2:887156
Conference
International Conference on Principles of Distributed Systems (OPODIS) 2010
Funder
Swedish Research Council for Environment, Agricultural Sciences and Spatial Planning, 37252706EU, FP7, Seventh Framework Programme, 248481
Note
Sponsorship:
This work was partially supported by the EU as part of FP7 Project PEPPHER (www.peppher.eu) under grant 248481 and the Swedish Research Council under grant number 37252706 and 13671-60582-29.
2015-12-222015-12-222018-01-10Bibliographically approved