Scalable and lock-free concurrent dictionaries

Proceedings of the ACM Symposium on Applied Computing

Volumn 2, Issue , 2004, Pages 1438-1445

  Sundell, Håkan ^a   Tsigas, Philippas ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Concurrent; Dictionary; Non blocking; Shared memory

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; GLOSSARIES; STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION;

CONCURRENT; NON-BLOCKING; SEQUENTIAL LIST STRUCTURE; SHARE MEMORY;

DATA STRUCTURES;

EID: 2442507992     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.968188     Document Type: Conference Paper

References (17)

1. J. Aspnes and M. Herlihy. Wait-free data structures in the asynchronous PRAM model. In ACM Symposium on Parallel Algorithms and Architectures, pages 340-349, 2000.
2. L. Boug, J. Gabarr, and X. Messeguer. Concurrent AVL revisited: Self-balancing distributed search trees. Research Report RR95-45, LIP, ENS Lyon, 1995.
3. T. L. Harris. A pragmatic implementation of non-blocking linked lists. In Proceedings of the 15th International Symposium of Distributed Computing, pages 300-314, Oct. 2001.
4. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 11(1):124-149, Jan. 1991.
5. M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
6. M. M. Michael. High performance dynamic lock-free hash tables and list-based sets. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, pages 73-82, 2002.
7. M. M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, pages 21-30, 2002.
8. M. M. Michael and M. L. Scott. Correction of a memory management method for lock-free data structures. Technical report, Computer Science Department, University of Rochester, 1995.
9. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668-676, 1990.
10. R. Rajkumar. Real-time synchronization protocols for shared memory multiprocessors. In Proceedings of the 10th International Conference on Distributed Computing Systems, pages 116-123, 1990.
11. L. Sha, R. Rajkumar, and J. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, 39(9):1175-1185, Sept. 1990.
12. A. Silberschatz and P. Galvin. Operating System Concepts. Addison Wesley, 1994.
13. H. Sundell and P. Tsigas. NOBLE: A non-blocking inter-process communication library. In Proceedings of the 6th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers, Lecture Notes in Computer Science, Springer Verlag, 2002.
14. H. Sundell and P. Tsigas. Fast and lock-free concurrent priority queues for multi-thread systems. In Proceedings of the 17th International Parallel and Distributed Processing Symposium. IEEE press, 2003.
15. H. Sundell and P. Tsigas. Scalable and lock-free concurrent dictionaries, extended version. Technical report, Computing Science, Chalmers University of Technology, Dec. 2003.
16. P. Tsigas and Y. Zhang. Integrating non-blocking synchronisation in parallel applications: Performance advantages and methodologies. In Proceedings of the 3rd ACM Workshop on Software and Performance, pages 55-67. ACM Press, 2002.
17. J. D. Valois. Lock-Free Data Structures. PhD thesis, Rensselaer Polytechnic Institute, Troy, New York, 1995.