High performance dynamic lock-free hash tables and list-based sets

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 73-82

  Michael, Maged M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; CONCURRENT ENGINEERING; MULTIPROGRAMMING; RELIABILITY; SYNCHRONIZATION;

DYNAMIC LOCK-FREE HASH TABLES; LIST-BASED SETS;

DATA STRUCTURES;

EID: 0036953737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564879.564881     Document Type: Conference Paper

References (25)

1. James H. Anderson and Mark Moir. Universal Constructions for Large Objects. IEEE Transactions on Parallel and Distributed Systems 10(12): 1317-1332, December 1999.
2. Greg Barnes. A Method for Implementing Lock-Free Shared-Data Structures. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 261-270, June-July 1993.
3. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, 1990.
4. David L. Detlefs, Paul A. Martin, Mark Moir, and Guy L. Steele Jr. Lock-Free Reference Counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 190-199, August 2001.
5. Michael B. Greenwald. Non-Blocking Synchronization and System Design. Ph.D. Thesis, Stanford University Technical Report STAN-CS-TR-99-1624, August 1999.
6. Timothy L. Harris. A Pragmatic Implementation of Non-Blocking Linked Lists. In Proceedings of the 15th International Symposium on Distributed Computing, pages 300-314, October 2001.
7. Maurice P. Herlihy. Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems 13(1): 124-149, January 1991.
8. Maurice P. Herlihy. A Methodology for Implementing Highly Concurrent Objects. ACM Transactions on Programming Languages and Systems 15(5): 745-770, November 1993.
9. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems 12(3): 463-492, July 1990.
10. IBM System/370 Extended Architecture, Principles of Operation. IBM Publication No. SA22-7085, 1983.
11. Amos Israeli and Lihu Rappoport. Disjoint-Access-Parallel Implementations of Strong Shared Memory Primitives. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 151-160, August 1994.
12. Donald E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley 1973.
13. Vladimir Lanin and Dennis Shasha. Concurrent Set Manipulation without Locking. In Proceedings of the 7th ACM Symposium on Principles of Database Systems, pages 211-220, March 1988.
14. Henry Massalin and Carlton Pu. A Lock-Free Multiprocessor OS Kernel. Technical Report No. CUCS-005-91, Columbia University, 1991.
15. Paul E. McKenney and John D. Slingwine. Read-Copy Update: Using Execution History to Solve Concurrency Problems. In Proceedings of the 11th International Conference on Parallel and Distributed Computing Systems, October 1998.
16. John M. Mellor-Crummey and Michael L. Scott. Scalable Reader-Writer Synchronization for Shared-Memory Multiprocessors. In Proceedings of the 3rd ACM Symposium on Principles and Practice of Parallel Programming, pages 106-113, April 1991.
17. Maged M. Michael. Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic Reads and Writes. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, July 2002.
18. Maged M. Michael and Michael L. Scott. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 267-275, May 1996.
19. Mark Moir. Practical Implementations of Non-Blocking Synchronization Primitives. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 219-228, August 1997.
20. Sundeep Prakash, Yann-Hang Lee, and Theodore Johnson. A Nonblocking Algorithm for Shared Queues Using Compare-and-Swap. IEEE Transactions on Computers 43(5): 548-559, May 1994.
21. Larry Rudolph and Zary Segall. Dynamic Decentralized Cache Schemes for MIMD Parallel Processors. In Proceedings of the 11th International Symposium on Computer Architecture, pages 340-347, June 1984.
22. Nir Shavit and Dan Touitou. Software Transactional Memory. Distributed Computing 10(2): 99-116, 1997.
23. R. Kent Treiber. Systems Programing: Coping with Parallelism. Research Report RJ 5118, IBM Almaden Research Center, April 1986.
24. John Turek, Dennis Shasha, and Sundeep Prakash. Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking. In Proceedings of the 11th ACM Symposium on Principles of Database Systems, pages 212-222, June 1992.
25. John D. Valois. Lock-Free Linked Lists Using Compare-and-Swap. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 214-222, August 1995.