Space- and time-adaptive nonblocking algorithms

Electronic Notes in Theoretical Computer Science

Volumn 78, Issue , 2003, Pages 260-280

  Herlihy, Maurice ^a   Luchangco, Victor ^b   Moir, Mark ^b  

^a Brown Univerity   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; SYNCHRONIZATION;

COMPARE-AND-SWAP (CAS) INSTRUCTION; DYNAMIC MEMORY MANAGEMENT; NONBLOCKING ALGORITHMS; NONBLOCKING DATA STRUCTURES;

DATA STRUCTURES;

EID: 18944389163     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)81017-X     Document Type: Conference Paper

References (20)

1. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proceedings of the 18th Annual ACM Symposium on Principles of Dsitributed Computing, pages 91-104, 1999.
2. Y. Afek, D. Dauber, and D. Touitou. Wait-free made fast. In Proceedings of the 27th Annual Symposium on Theory of Computing, pages 538-547, 1995.
3. A. Agesen, D. Detlefs, C. Flood, A. Garthwaite, P. Martin, M. Moir, N. Shavit, and G. Steele. DCAS-based concurrent deques. Theory of Computing Systems, 2002. To appear. A preliminary version appeared in the Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures.
4. J. Anderson and M. Moir. Using local-spin κ-exclusion algorithms to improve wait-free object implementations. Distributed Computing, 11:1-20, 1997.
5. A preliminary version appeared in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, 1994 pp. 141-150.
6. H. Attiya, A. Bar-Noy, D. Dolve, D. Koller, D. Peleg, and R. Reischuk. Achievable cases in a asynchronous environment. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pages 337-346, 1987.
7. H. Attiya, A. Fouren, and E. Gafni. An adaptive collect algorithm and application. Distributed Computing, 2002. to appear.
8. D. Detlefs, C. Flood, A. Garthwaite, P. Martin, N. Shavit, and G. Steele. Even better DCAS-based concurrent deques. In Proceedings of the 14th International Conference on Distributed Computing, pages 59-73, 2000.
9. D. Detlefs, P. Martin, M. Moir, and G. Steele. Lock-free refernece counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 190-199, 2001.
10. Dave Dice and Alex Garthwaite. Mostly lock-free malloc. In ACM SIGPLAN international symposium on Memory management. ACM Press, 2002.
11. M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Dynamic-sized lock-free data structures. Technical Report TR-2002-110, Sun Microsystems Laboratories, 2002.
12. M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. In Proceedings of the 16th International Symposium on DIStributed Computing, 2002. A improved version of this paper is in preparation for journal submission; please contact authors.
13. Lamport A. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9). September 1979;241-248
14. P. Martin, M. Moir, and G. Steele. Dcas-based concurrent deques supporting bulk allocation. Technical Report TR-2002-111, Sun Microsystems Laboratories, 2002.
15. M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st Annual ACM Symposium on the Principles of Distributed Computing, 2002.
16. M. Nichael and M. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, pages 267-276, 1996.
17. M. Moir and J. Anderson. Waite-free algorithms for last,-long-lived renaming. Science of Computer Programming, 25:1-39 1995.
18. A preliminary version appeared in Proceedings of the 8th International Workshop on Distributed Algorithms, 1994, pp. 141-155.
19. M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus-making resilient algorithms fast in practice. In Proceedings of the second annual ACM-SIAM Symposium on Discrete algorithms, pages 351-362, 1991.
20. R. Treiber. Systems programming: Coping with parallelism. Technical Report RJ5118, IBM Almaden Research Center, 1986.