A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 134-143

  Tsigas, P ^a   Zhang, Y ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTER PROGRAMMING LANGUAGES; MULTIPROGRAMMING; QUEUEING NETWORKS;

SHARED MEMORY MULTIPROCESSOR SYSTEMS;

MULTIPROCESSING SYSTEMS;

EID: 0034832386     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378611     Document Type: Conference Paper

References (14)

1. Starfire - Extending the SMP envelope
2. Wait-free synchronization
3. Linearizability: A correctness condition for concurrent objects
4. Empirical studies of competitive spinning for a shared-memory multiprocessor
5. Specifying concurrent program modules
6. The SGI origin: A ccNUMA highly scalable server
7. Algorithms for scalable synchronization on shared-memory multiprocessors
8. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
9. A nonblocking algorithm for shared queues using compare-and-swap
10. The SPLASH-2 programs: Characterization and methodological considerations
11. The effect of scheduling discipline on spin overhead in shared memory parallel processors