Scalability versus semantics of concurrent FIFO queues

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 331-332

  Payer, Hannes ^a   Roeck, Harald ^a   Kirsch, Christoph M ^a   Sokolova, Ana ^a  

^a UNIVERSITY OF SALZBURG   (Austria)

Author keywords

concurrent data structures; multiprocessors; synchronization

Indexed keywords

CONCURRENT DATA-STRUCTURES; FIFO ORDER; FIFO QUEUE; FIRST-IN-FIRST-OUT; HIGH PROBABILITY; HIGHER-DEGREE; MULTIPROCESSORS; SYNCHRONIZATION MECHANISMS;

CONCURRENCY CONTROL; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; SCALABILITY; SEMANTICS;

QUEUEING THEORY;

EID: 79959888547     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993869     Document Type: Conference Paper

References (5)

1. Y. Afek, G. Korland, and E. Yanovsky. Quasi-linearizability: Relaxed consistency for improved concurrency. In Proc. Conference on Principles of Distributed Systems (OPODIS), pages 395-410. Springer, 2010.
2. P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking. Balanced allocations: The heavily loaded case. SIAM Journal on Computing, 35(6):1350-1385, 2006. (Pubitemid 44935683)
3. C. Kirsch, H. Payer, and H. Röck. Scalunknown sign: Non-linearizable computing breaks the scalability barrier. Technical Report 2010-07, Department of Computer Sciences, University of Salzburg, November 2010.
4. M. Michael and M. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proc. Symposium on Principles of Distributed Computing (PODC), pages 267-275. ACM, 1996.
5. N. Shavit. Data structures in the multicore age. Communications of the ACM, 54:76-84, March 2011.