Cache-aware lock-free queues for multiple producers/consumers and weak memory consistency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6490 LNCS, Issue , 2010, Pages 302-317

  Gidenstam, Anders ^a   Sundell, Håkan ^a   Tsigas, Philippas ^b  

^a UNIVERSITY OF BORÅS   (Sweden)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE BEHAVIOR; FIFO QUEUE; LOCK-FREE; LOCK-FREE ALGORITHMS; MEMORY CONSISTENCY; MEMORY MODELS; MULTI-CORE PLATFORMS; SHARED DATA;

ALGORITHMS; DATA STRUCTURES;

CACHE MEMORY;

EID: 78650913187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17653-1_23     Document Type: Conference Paper

References (11)

1. Giacomoni, J., Moseley, T., Vachharajani, M.: Fastforward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2008), pp. 43-52. ACM, New York (2008)
2. Gidenstam, A., Papatriantafilou, M., Sundell, H., Tsigas, P.: Efficient and reliable lock-free memory reclamation based on reference counting. IEEE Transactions on Parallel and Distributed Systems 20(8), 1173-1187 (2009)
3. Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 11(1), 124-149 (1991)
4. Higham, L., Kawash, J.: Impact of instruction re-ordering on the correctness of shared-memory programs. In: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 25-32. IEEE, Los Alamitos (December 2005)
5. Hoffman, M., Shalev, O., Shavit, N.: The baskets queue. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 401-414. Springer, Heidelberg (2007)
6. Lamport, L.: Specifying concurrent program modules. ACM Trans. Program. Lang. Syst. 5(2), 190-222 (1983)
7. Michael, M.M.: Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems 15(8) (August 2004)
8. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 267-275. ACM Press, New York (1996)
9. Moir,M., Nussbaum, D., Shalev, O., Shavit, N.: Using elimination to implement scalable and lock-free fifo queues. In: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 253-262. ACM, New York (2005)
10. Sundell, H., Tsigas, P.: Noble: non-blocking programming support via lock-free shared abstract data types. SIGARCH Comput. Archit. News 36(5), 80-87 (2008)
11. Tsigas, P., Zhang, Y.: A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), pp. 134-143. ACM Press, New York (2001)