Fast and lock-free concurrent priority queues for multi-thread systems

Journal of Parallel and Distributed Computing

Volumn 65, Issue 5, 2005, Pages 609-627

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

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Concurrent; Lock free; Multi thread; Non blocking; Priority queue; Real time; Shared data structure; Skip list

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; DATA PROCESSING; DATA STRUCTURES; PROBLEM SOLVING; QUEUEING THEORY; REAL TIME SYSTEMS; SYNCHRONIZATION;

CONCURRENT; LOCK-FREE; MULTI-THREAD; NON-BLOCKING; PRIORITY QUEUE; REAL TIME; SHARED DATA STRUCTURE; SKIP LIST;

MULTIPROCESSING SYSTEMS;

EID: 15844367699     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.12.005     Document Type: Article

References (32)

1. M. Herlihy, V. Luchangco, and M. Moir Obstruction-free synchronization double-ended queues as an example Proceedings of the 23rd International Conference on Distributed Computing Systems 2003
2. G. Barnes, Wait-free algorithms for heaps, Technical Report, Computer Science and Engineering, University of Washington, February 1992.
3. D. Detlefs, P. Martin, M. Moir, and G. Steele Jr Lock-free reference counting Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing 2001
4. M. Fomitchev, Lock-free linked lists and skip lists, Master's thesis, York University, November 2003.
5. M. Fomitchev, and E. Ruppert Lock-free linked lists and skip lists Proceedings of the 23rd Annual Symposium on Principles of Distributed Computing 2004 50 59
6. K.A. Fraser, Practical lock-freedom, Ph.D. Thesis, University of Cambridge, Technical Report, No. 579, February 2004.
7. M. Grammatikakis, and S. Liesche Priority queues and sorting for parallel simulation IEEE Trans. Software Eng. SE-26 5 2000 401 422
8. M. Greenwald, Non-blocking synchronization and system design, Ph.D. Thesis, Stanford University, Palo Alto, CA, 1999.
9. T.L. Harris A pragmatic implementation of non-blocking linked lists Proceedings of the 15th International Symposium of Distributed Computing 2001 300 314
10. M. Herlihy Wait-free synchronization ACM Trans. Program. Lang. Systems 11 1 1991 124 149
11. N. Audsley, A. Burns, R. Davis, K. Tindell, and A. Wellings Fixed priority pre-emptive scheduling an historical perspective Real-Time Systems 8 2/3 1995 129 154
12. M. Herlihy, V. Luchangco, and M. Moir The repeat offender problem a mechanism for supporting dynamic-sized, lock-free data structure Proceedings of 16th International Symposium on Distributed Computing 2002
13. M. Herlihy, and J. Wing Linearizability a correctness condition for concurrent objects ACM Trans. Program. Lang. Systems 12 3 1990 463 492
14. G. Hunt, M. Michael, S. Parthasarathy, and M. Scott An efficient algorithm for concurrent priority queue heaps Inform. Process. Lett. 60 3 1996 151 157
15. A. Israeli, L. Rappoport, Efficient wait-free implementation of a concurrent priority queue, in: Proceedings of the Seventh International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, vol. 725, Springer, Berlin, 1993, pp. 1-17.
16. D.W. Jones Concurrent operations on priority queues Commun. ACM 32 1 1989 132 137
17. I. Lotan, and N. Shavit Skiplist-based concurrent priority queues Proceedings of the International Parallel and Distributed Processing Symposium 2000 2000 IEEE Press New York 263 268
18. M.M. Michael Safe memory reclamation for dynamic lock-free objects using atomic reads and writes Proceedings of the 21st ACM Symposium on Principles of Distributed Computing 2002 21 30
19. M.M. Michael, M.L. Scott, Correction of a memory management method for lock-free data structures, Technical Report, Computer Science Department, University of Rochester, 1995.
20. W. Pugh Skip lists a probabilistic alternative to balanced trees Commun. ACM 33 6 1990 668 676
21. R. Rajkumar Real-time synchronization protocols for shared memory multiprocessors Proceedings of the 10th International Conference on Distributed Computing Systems 1990 116 123
22. A. Silberschatz, and P. Galvin Operating system concepts 1994 Addison-Wesley
23. L. Sha, R. Rajkumar, and J. Lehoczky Priority inheritance protocols an approach to real-time synchronization IEEE Trans. Comput. 39 9 1990 1175 1185
24. N. Shavit, and A. Zemach Scalable concurrent priority queue algorithms Symposium on Principles of Distributed Computing 1999 113 122
25. H. Sundell, and P. Tsigas Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information Proceedings of the Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA 2000) 2000 IEEE Press New York 433 440
26. H. Sundell, P. Tsigas, NOBLE: A non-blocking inter-process communication library, in: Proceedings of the Sixth Workshop on Languages, Compilers and Run-time Systems for Scalable Computers, Lecture Notes in Computer Science, Springer, Berlin, 2002.
27. H. Sundell, P. Tsigas, Fast and lock-free concurrent priority queues for multi-thread systems, Technical Report 2003-01, Computing Science, Chalmers University of Technology, January 2003.
28. H. Sundell, and P. Tsigas Fast and lock-free concurrent priority queues for multi-thread systems Proceedings of the 17th International Parallel and Distributed Processing Symposium 2003 IEEE Press New York p. 11
29. H. Sundell, and P. Tsigas Scalable and lock-free concurrent dictionaries Proceedings of the 19th ACM Symposium on Applied Computing 2004 ACM Press New York 1438 1445
30. P. Tsigas, and Y. Zhang Evaluating the performance of non-blocking synchronization on shared-memory multiprocessors Proceedings of the International Conference on Measurement and Modeling of Computer Systems 2001 ACM Press New York 320 321
31. P. Tsigas, and Y. Zhang Integrating non-blocking synchronisation in parallel applications performance advantages and methodologies Proceedings of the 3rd ACM Workshop on Software and Performance 2002 ACM Press New York 55 67
32. J.D. Valois, Lock-free data structures, Ph.D. Thesis, Rensselaer Polytechnic Institute, Troy, New York, 1995.