A practical multi-word compare-and-swap operation

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

Volumn 2508, Issue , 2002, Pages 265-279

  Harris, Timothy L ^a   Fraser, Keir ^a   Pratt, Ian A ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

COMPARE AND SWAPS; MEMORY LOCATIONS; MULTI-WORD; NON-BLOCKING; NONOVERLAPPING; PROCESSOR DESIGN; SINGLE WORDS;

DATA STRUCTURES;

EID: 84947240242     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36108-1_18     Document Type: Conference Paper

References (17)

1. S. V. Adve and K. Gharachorloo. Shared memory consistency models: a tutorial. IEEE Computer, 29(12):66-76, Dec. 1996.
2. J. H. Anderson and M. Moir. Universal constructions for multi-object operations. In Proc. 14th PODC, pp 184-193, Aug. 1995.
3. J. H. Anderson, S. Ramamurthy, and R. Jain. Implementing wait-free objects on priority-based systems. In Proc. 16th PODC, pp 229-238, Aug. 1997.
4. D. L. Detlefs, C. H. Flood, A. T. Garthwaite, P. A. Martin, N. N. Shavit, and G. L. Steele Jr. Even better DCAS-based concurrent deques. In Proc. 14th DISC, LNCS 1914, pp 59-73, Oct. 2000.
5. M. Greenwald. Non-blocking synchronization and system design. PhD thesis, Stanford University, Aug. 1999.
6. T. L. Harris. A pragmatic implementation of non-blocking linked lists. In Proc. 15th DISC, LNCS 2180, pp 300-314, Oct. 2001.
7. M. Herlihy. A methodology for implementing highly concurrent data objects. ACM TOPLAS, 15(5):745-770, Nov. 1993.
8. M. Herlihy, V. Luchangco, and M. Moir The repeat offender problem: a mechanism for supporting dynamic-sized, lock-free data structures. In Proc. 16th DISC, 2002.
9. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
10. A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In Proc. 13th PODC, pp 151-160, Aug. 1994.
11. H. Massalin and C. Pu. A lock-free multiprocessor OS kernel. Technical Report CUCS-005-91, Columbia University, Department of Computer Science, June 1991.
12. J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM TOCS, 9(1):21-65, Feb. 1991.
13. M. M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proc. 21st PODC, July 2002.
14. M. Moir. Practical implementations of non-blocking synchronization primitives. In Proc. 16th PODC, pp 219-228, Aug. 1997.
15. M. Moir. Transparent support for wait-free transactions. In Distributed Algorithms, 11th International Workshop, LNCS 1320, pp 305-319, Sept. 1997.
16. N. N. Shavit and D. Touitou. Software transactional memory. In Proc. 14th PODC, pp 204-213, Aug. 1995.
17. J. D. Valois. Lock-free linked lists using compare-and-swap. In Proc. 14th PODC pp 214-222, Aug. 1995.