List of all Publications |
[Hoare, 1974]![]()
|
C. A. R. Hoare (Oct 1974). Monitors: An Operating System Structuring Concept. In: Communications of the ACM, :549-557. |
[Lomet, 1977]
|
David B. Lomet (Mar 1977). Process Structuring, Synchronization, and Recovery Using Atomic Actions. In: ACM Conference on Language Design for Reliable Software. pp. 128--137. |
[Lamport, 1977]![]()
|
Leslie Lamport (Nov 1977). Concurrent Reading and Writing. In: Communications of the ACM, 20(11):806--811. |
[Kung and Robinson, 1981]![]()
|
H.T. Kung and John T. Robinson (Jun 1981). On Optimistic Methods of Concurrency Control. In: ACM Transactions on Database Systems, 6(2):213--226. |
[Gray, 1981]
|
Jim Gray (Sep 1981). The Transaction Concept: Virtues and Limitations. In: Seventh International Conference on Very Large Data Bases. pp. 144--154. |
[Knight, 1986]![]()
|
Thomas F. Knight (Aug 1986). An Architecture for Mostly Functional Languages. In: Proceedings of ACM Lisp and Functional Programming Conference. pp. 500--519. |
[Jensen et al., 1987]
|
Eric H. Jensen and Gary W. Hagensen and Jeffrey M. Broughton (Nov 1987). A New Approach to Exclusive Data Access in Shared Memory Multiprocessors. (Technical Report UCRL-97663). |
[Chang and Mergen, 1988]![]()
|
Albert Chang and Mark F. Mergen ( 1988). 801 Storage: Architecture and Programming. In: ACM Transactions on Computer Systems (TOCS). Volume 61. pp. 28--50. |
[Adve, 1990]![]() ![]()
|
Sarita V.and Hill Adve (May 1990). Weak Ordering - A New Definition. In: Proceedings of the 17th Annual International Symposium on Computer Architecture. pp. 2--14. |
[Herlihy, 1991]![]()
|
Maurice Herlihy (Jan 1991). Wait-Free Synchronization. In: ACM Transactions on Programming Languages and Systems, 13(1):124--149. |
[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. |
[Banatre et al., 1991]
|
Michel Banatre and Gilles Muller and Bruno Rochat and P. Sanchez ( 1991). Design Decisions for the FTM: A General Purpose Fault Tolerant Machine. In: FTCS. pp. 71-78. |
[Herlihy, 1993]
|
Maurice Herlihy (Nov 1993). A Methodology for Implementing Highly Concurrent Data Objects. In: ACM Transactions on Programming Languages and Systems, 15(5):745--770. |
[Wing and Gong, 1993]
|
Jeanette M. Wing and Chun Gong (Jan-Feb 1993). Testing and Verifying Concurrent Objects. In: Journal of Parallel and Distributed Computing, 17(2):164--182. |
[Attiya et al., 1994]![]()
|
Hagit Attiya and Nancy Lynch and Nir Shavit (Jul 1994). Are Wait-Free Algorithms Fast? In: Journal of the Association for Computing Machinery, 41(4):725--763. |
[Guerraoui, 1994]![]()
|
Rachid Guerraoui ( 1994). Atomic Object Composition. In: ECOOP. pp. 118-138. |
[Shavit and Touitou, 1995]![]()
|
Nir Shavit and Dan Touitou (Aug 1995). Software Transactional Memory. In: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing. pp. 204--213. |
[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. |
[Adve and Gharachorloo, 1996]![]()
|
Sarita V. Adve and Kourosh Gharachorloo (Dec 1996). Shared Memory Consistency Models: A Tutorial. In: IEEE Computer, 29(12):66--76. |
[Moir, 1997]
|
Mark Moir (Sep 1997). Transparent Support for Wait-Free Transactions. In: 11th International Workshop on Distributed Algorithms. pp. 305--319. |
[Hill, 1998]![]() ![]()
|
Mark D. Hill (Aug 1998). Multiprocessors Should Support Simple Memory Consistency Models. In: IEEE Computer, 31(8):28--34. |
[Gniady et al., 1999]![]()
|
Chris Gniady and Babak Falsafi and T. N. Vijaykumar (May 1999). Is SC + ILP = RC? In: International Symposium on Computer Architecture. pp. 162--171. |
[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. |
[Rajwar, 2002]![]()
|
Ravi Rajwar (Oct 2002). Speculation-Based Techniques for Transactional Lock-Free Execution of Lock-Based Programs. PhD thesis, University of Wisconsin. |
[Flanagan and Qadeer, 2003]![]()
|
Cormac Flanagan and Shaz Qadeer (Jan 2003). Types for Atomicity. In: ACM SIGPLAN Workshop on Types in Language Design and Implementation. pp. 1--12. |
[Herlihy et al., 2003]![]()
|
Maurice Herlihy and Victor Luchangco and Mark Moir and III William N. Scherer (Jul 2003). Software Transactional Memory for Dynamic-Sized Data Structures. :92--101. |
[Harris and Fraser, 2003]![]()
|
Tim Harris and Keir Fraser (Oct 2003). Language Support for Lightweight Transactions. In: Object-Oriented Programming, Systems, Languages, and Applications. pp. 388--402. |
[Black et al., 2003]![]()
|
Andrew P. Black and Vincent Cremet and Rachid Guerraoui and Martin Odersky ( 2003). An Equational Theory for Transactions. In: FSTTCS, Springer Verlag. pp. 38-49. |
[Rajwar and Goodman, 2003]![]()
|
Ravi Rajwar and James R. Goodman (Nov-Dec 2003). Transactional Execution: Toward Reliable, High-Performance Multithreading.. In: IEEE Micro, 23(6):117-125. |
[Fraser, 2003]
|
Keir Fraser ( 2003). Practical lock freedom. PhD thesis, Cambridge University Computer Laboratory. Also available as Technical Report UCAM-CL-TR-579. |
[Gniady and Falsafi, 2003]![]()
|
Chris Gniady and Babak Falsafi ( 2003). Speculative Sequential Consistency with Little Custom Storage. In: Journal of Instruction-Level Parallelism, 5. |
[Lie, 2004]![]()
|
Sean Lie (May 2004). Hardware Support for Unbounded Transactional Memory. Masters thesis, Massachusetts Institute of Technology. |
[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. |
[Moore, 2004]
|
Kevin E. Moore (Oct 2004). Thread-Level Transactional Memory. In: Wisconsin Industrial Affiliates Meeting. Wisconsin Industrial Affiliates Meeting. |
[Ennals, 2005]![]()
|
Robert Ennals (Jan 2005). Efficient Software Transactional Memory. Technical Report Nr. IRC-TR-05-051. Intel Research Cambridge Tech Report. |
[Moir, 2005]![]()
|
Mark Moir (Jul 2005). Hybrid Transactional Memory. Unpublished manuscript. |
[Ennals, 2006]![]()
|
Robert Ennals (Jan 2006). Software Transactional Memory Should Not Be Obstruction-Free. Technical Report Nr. IRC-TR-06-052. Intel Research Cambridge Tech Report. |
[Scott, 2006]![]()
|
Michael L. Scott (Jun 2006). Sequential Specification of Transactional Memory Semantics. In: ACM SIGPLAN Workshop on Transactional Computing. Held in conjunction with PLDI 2006. |
[Riley and Zilles, 2006]![]()
|
Nicholas Riley and Craig Zilles (Oct 2006). Hardware Transactional Memory Support for Lightweight Dynamic Language Evolution. In: Dynamic Language Symposium. |
[Blundell et al., 2006]![]()
|
Colin Blundell and E Christopher Lewis and Milo M. K. Martin (Nov 2006). Subtleties of Transactional Memory Atomicity Semantics. In: Computer Architecture Letters, 5(2). |
[Larus and Rajwar, 2006]![]()
|
James R. Larus and Ravi Rajwar ( 2006). Transactional Memory. Morgan & Claypool. |
[Ceze et al., 2007]![]() |