A Lock-Free Multiprocessor Os Kernel.
(CUCS-005-91). Columbia University.
Nonblocking synchronization |
| [Massalin and Pu, 1991]
|
Henry Massalin and Calton Pu (May 1991). A Lock-Free Multiprocessor Os Kernel. (CUCS-005-91). Columbia University. |
| [Bershad, 1991]
|
Brian N. Bershad (Sep 1991). Practical Considerations for Lock-Free Concurrent Objects. (CMU-CS-91-183). Carnegie Mellon University. |
[Allemany and Felten, 1992]
|
Juan Allemany and Ed Felten (Aug 1992). Performance Issues in Non-Blocking Synchronization on Shared-Memory Multiprocessors. In: Proceedings of the 11th ACM Symposium on Principles of Distributed Computing. pp. 125--134. |
| [Turek et al., 1992]
|
John Turek and Dennis Shasha and Sundeep Prakash (Aug 1992). Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking. In: Proceedings of the 11th ACM Symposium on Principles of Distributed Computing. pp. 212--222. |
| [Barnes, 1993]
|
Greg Barnes (Jun 1993). Method for Implementing Lock-Free Shared Data Structures. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures. pp. 261--270. |
| [Israeli and Rappoport, 1993]
|
Amos Israeli and Lihu Rappoport (Sep 1993). Efficient Wait-Free Implementation of a Concurrent Priority Queue. In: 7th International Workshop on Distributed Algorithms. pp. 27--29. |
| [Valois, 1995]
|
John D. Valois (Aug 1995). Lock-Free Linked Lists Using Compare-and-Swap. In: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing. pp. 214--222. |
| [Johnson, 1995]
|
Theodore Johnson (Oct 1995). Characterizing the Performance of Algorithms for Lock-Free Objects. In: IEEE Transactions on Computers, 44(10):1194--1207. |
| [Valois, 1995]
|
John D. Valois ( 1995). Lock-Free Data Structures. PhD thesis, Rochester Institute of Technology. |
| [Michael and Scott, 1996]
|
Maged M. Michael and Michael L. Scott (May 1996). Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing. pp. 267--275. |
[Michael and Scott, 1997]
|
Maged M Michael and Michael L. Scott (Apr 1997). Relative Performance of Preemption-Safe Locking and Non-Blocking Synchronization on Multiprogrammed Shared Memory Multiprocessors. In: Proceedings of the 11th International Parallel Processing Symposium. Geneva, Switzerland. Earlier version published as ``Concurrent Update on Multiprogrammed Shared Memory MultiProceedingsessors,'' TR 614, University of Rochester Computer Science Dept., May 1996. |
| [Michael and Scott, 1998]
|
Maged M. Michael and Michael L. Scott ( 1998). Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors. In: Journal of Parallel and Distributed Computing, 51(1):1--26. |
| [Anderson and Moir, 1999]
|
James H. Anderson and Mark Moir (Dec 1999). Universal Constructions for Large Objects. In: IEEE Transactions on Parallel and Distributed Systems, 10(12):1317-1332. |
| [Greenwald, 1999]
|
Michael Greenwald ( 1999). Non-Blocking Synchronization and System Design. PhD thesis, Stanford University, Also appears as Stanford University Technical Report STAN-CS- TR-99-1624, Stanford University, Stanford, CA, 1999.. |
| [Harris et al., 2002]
|
Tim Harris and Keir Fraser and Ian A. Pratt (Oct 2002). A practical multi-word compare-and-swap operation. In: Proceedings of the 16th International Symposium on Distributed Computing. pp. 265--279. |
| [Herlihy et al., 2003]
|
Maurice Herlihy and Victor Luchangco and Mark Moir ( 2003). Obstruction-Free Synchronization: Double-Ended Queues as an Example. In: ICDCS '03: Proceedings of the 23rd International Conference on Distributed Computing Systems. pp. 522. |
| [Michael, 2004]
|
Maged M. Michael (Jun 2004). Hazard Pointers: Safe Memory Reclamation for Lock-FreeObjects. In: IEEE Transactions on Parallel and Distributed Systems, 15(6). |
| [Michael, 2004]
|
Maged M. Michael (Jun 2004). Scalable Lock-Free Malloc. In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation. pp. 35--46. |
| [Scherer III and Scott, 2004]
|
William N. Scherer III and Michael L. Scott (Oct 2004). Nonblocking Concurrent Objects with Condition Synchronization. In: Proceedings of the 18th International Symposium on Distributed Computing. Amsterdam, The Netherlands. |
| [Pizlo et al., 2004]
|
Filip Pizlo and Marek Prochazka and Suresh Jagannathan and Jan Vitek ( 2004). Transactional Lock-Free Objects for Real-Time Java. In: Proceedings of the PODC Workshop on Concurrency and Synchronization in Java Programs. pp. 54--62. |
| [Welc et al., 2004]
|
Adam Welc and Suresh Jagannathan and Antony L. Hosking ( 2004). Transactional monitors for concurrent objects. In: (ed.), Proceedings of the European Conference on Object-Oriented Programming. Volume 3086 of Lecture Notes in Computer Science. pp. 519--542. Published by Springer-Verlag. |
| [Harris and Fraser, 2005]
|
Tim Harris and Keir Fraser (Jun 2005). Revocable locks for non-blocking programming. In: Proceedings of the ACM Symposium on Principles and Practice of Parallel Programming, to appear. |
| [Scherer III et al., 2005]
|
William N. Scherer III and Doug Lea and Michael L. Scott (Oct 2005). A Scalable Elimination-based Exchange Channel. In: Proceedings, Workshop on Synchronization and Concurrency in Object-Oriented Languages. San Diego, CA. In conjunction with OOPSLA'05. |
| [Scherer III et al., 2006]
|
William N. Scherer III and Doug Lea and Michael L. Scott (Mar 2006). Scalable Synchronous Queues. In: Proceedings of the 11th PPOPP ACM Symposium on Principles and Practice of Parallel Programming. New York, NY. |
| [Spear et al., 2007]
|
Michael F. Spear and Arrvindh Shriraman and Luke Dalessandro and Sandhya Dwarkadas and Michael L. Scott (Jun 2007). Nonblocking Transactions Without Indirection Using Alert-on-Update. In: Proceedings of the 19th Annual ACM SYMP on Parallelism in Algorithms and Architectures. San Diego, CA. |
| [Marathe et al., 2007]
|
Virendra J. Marathe and Michael F Spear and Michael L. Scott (sep 2007). Transaction Safe Nonblocking Data Structures (brief announcement). In: DISC~'07: Proc. 21st International Symposium on Distributed Computing. Springer-Verlag Lecture Notes in Computer Science volume 4731. Expanded version available as TR 924, University of Rochester Computer Science Dept., September 2007. |
| [Ellen et al., 2007]
|
Faith Ellen and Yossi Lev and Victor Luchangco and Mark Moir ( 2007). SNZI: scalable NonZero indicators. In: PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing. New York, NY, USA, pp. 13--22. Published by ACM. |
| [Afek et al., 2009]
|
Yehuda Afek and Nir Shavit and Moran Tzafrir (sep 2009). Interrupting Snapshots and the Java Size() Method. In: DISC~'09: Proc. 23rd International Symposium on Distributed Computing. |
| [Noel, 2010]
|
Cyprien Noel ( 2010). Extensible software transactional memory. In: C3S2E '10: Proceedings of the Third C* Conference on Computer Science and Software Engineering. New York, NY, USA, pp. 23--34. Published by ACM. |