- Adaptive Integration of Hardware and Software Lock Elision Techniques.
- Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir, SPAA 2014
- Hardware extensions to make lazy subscription safe
- Dave Dice, Tim Harris, Alex Kogan, Yossi Lev, Mark Moir, Extended version of our WTTM 2014 paper.
- Pitfalls of lazy subscription
- Dave Dice, Tim Harris, Alex Kogan, Yossi Lev, Mark Moir, 6th Workshop on the Theory of Transactional Memory (WTTM 2014)
- Towards Whatever-Scale Abstractions for Data-Driven Parallelism
- Mark Moir, Maurice Herlihy, Tim Harris, Victor Luchangco, Virendra Marathe, Yossi Lev, Yujie Liu, First Workshop on Rack-Scale Computing
- Constrained Data-Driven Parallelism
- Tim Harris, Yossi Lev, Victor Luchangco, Virendra Marathe, Mark Moir, In Proceedings, (2013)
- Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores.
- Irina Calciu, Dave Dice, Tim Harris, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir, OPODIS 2013:83-97
- Scalable statistics counters (Poster)
- Dave Dice, Yossi Lev, Mark Moir, PPoPP 2013
- Scalable statistics counters.
- Dave Dice, Yossi Lev, Mark Moir, SPAA 2013:43-52
- Towards formally specifying and verifying transactional memory.
- Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir, Formal Asp. Comput. (FAC) 25(5):769-799 (2013)
- Using hardware transactional memory to correct and simplify and readers-writer lock algorithm.
- Dave Dice, Yossi Lev, Yujie Liu, Victor Luchangco, Mark Moir, PPOPP 2013:261-270
- A Framework for Formally Verifying Software Transactional Memory Algorithms.
- Mohsen Lesani, Victor Luchangco, Mark Moir, CONCUR 2012:516-530
- Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory.
- Luke Dalessandro, Francois Carouge, Sean White, Yossi Lev, Mark Moir, Michael Scott, Michael Spear, ASPLOS 2011:39-52
- On The Power of Hardware Transactional Memory to Simplify Memory Management
- Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir, Conference Publication, (2011)
- Towards Formally Specifying and Verifying Transactional Memory
- Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir, Article, (2011)
- Simplifying concurrent algorithms by exploiting hardware transactional memory.
- David Dice, Yossi Lev, Virendra Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski, SPAA 2010:325-334
- What Kinds of Applications Can Benefit from Transactional Memory?
- Mark Moir, Dan Nussbaum, Daniel Nussbaum, In Proceedings, (2010)
- Anatomy of a Scalable Software Transactional Memory
- Yossi Lev, Victor Luchangco, Marek Olszewski, Virendra Marathe, Mark Moir, Dan Nussbaum, In Proceedings, (2009)
- Early Experience with a Commercial Hardware Transactional Memory Implementation
- David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum, Marek Olszewski, Technical Report, (2009)
- Early experience with a commercial hardware transactional memory implementation.
- David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum, ASPLOS 2009:157-168
- Exceptions and Transactions in C++
- Adam Welc, Ali-Reza Adl-Tabatabai, Mark Moir, Mark Moir, Ravi Narayanaswamy, Victor Luchangco, Victor Luchangco, Xinmin Tian, Yang Ni, In Proceedings, (2009)
- Exceptions and Transactions in C++
- Adam Welc, Ali-Reza Adl-Tabatabai, Dan Nussbaum, Mark Moir, Peng Wu, Ravi Narayanaswamy, Victor Luchangco, Virendra Marathe, Xinmin Tian, Yang Ni, In Proceedings, (2009)
- NZTM: nonblocking zero-indirection transactional memory.
- Fuad Tabba, Mark Moir, James Goodman, Andrew Hay, Cong Wang, SPAA 2009:204-213
- Nonblocking Algorithms and Backward Simulation.
- Simon Doherty, Mark Moir, DISC 2009:274-288
- Nonblocking k-Compare-Single-Swap.
- Victor Luchangco, Mark Moir, Nir Shavit, In Proceedings, (2009)
- The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster).
- Mark Moir, Kevin Moore, Daniel Nussbaum, SPAA 2008:362
- Toward high performance nonblocking software transactional memory.
- Virendra Marathe, Mark Moir, PPOPP 2008:227-236
- Wait-Free Synchronization.
- Mark Moir, Encyclopedia of Algorithms 2008
- A Lazy Concurrent List-Based Set Algorithm.
- Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William Scherer III, Nir Shavit, Parallel Processing Letters (PPL) 17(4):411-424 (2007)
- Efficient nonblocking software transactional memory.
- Virendra Marathe, Mark Moir, PPOPP 2007:136-137
- SNZI: Scalable NonZero Indicators.
- Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir, PODC 2007:13-22
- A dynamic-sized nonblocking work stealing deque.
- Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit, Distributed Computing (DC) 18(3):189-207 (2006)
- A flexible framework for implementing software transactional memory.
- Maurice Herlihy, Victor Luchangco, Mark Moir, OOPSLA 2006:253-262
- Composite Abortable Locks.
- Virendra Marathe, Mark Moir, Nir Shavit, IPDPS 2006:1-10
- Formal Verification of a Lazy Concurrent List-Based Set Algorithm.
- Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir, CAV 2006:475-488
- Hybrid transactional memory.
- Peter Damron, Alexandra Fedorova, Yossi Lev, Victor Luchangco, Mark Moir, Daniel Nussbaum, ASPLOS 2006:336-346
- A Lazy Concurrent List-Based Set Algorithm.
- Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit, OPODIS 2005:3-16
- Concurrency and synchronization in Java programs.
- Mark Moir, Nir Shavit, Jan Vitek, Sci. Comput. Program. (SCP) 58(3):291-292 (2005)
- Dynamic-Sized Nonblocking Work Stealing Deque, A
- Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit, Technical Report, (2005)
- Nonblocking memory management support for dynamic-sized data structures.
- Maurice Herlihy, Victor Luchangco, Paul Martin, Mark Moir, ACM Trans. Comput. Syst. (TOCS) 23(2):146-196 (2005)
- Obstruction-Free Algorithms Can Be Practically Wait-Free.
- Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit, DISC 2005:78-92
- Obstruction-Free Step Complexity: Lock-Free DCAS as an Example.
- Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit, DISC 2005:493-494
- Using elimination to implement scalable and lock-free FIFO queues.
- Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit, SPAA 2005:253-262
- Bringing practical lock-free synchronization to 64-bit applications.
- Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir, PODC 2004:31-39
- DCAS is not a silver bullet for nonblocking algorithm design.
- Simon Doherty, David Detlefs, Lindsay Groves, Christine Flood, Victor Luchangco, Paul Martin, Mark Moir, Nir Shavit, Guy Steele Jr., SPAA 2004:216-224
- Formal Verification of a Practical Lock-Free Queue Algorithm.
- Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir, FORTE 2004:97-114
- Nonblocking k-compare-single-swap.
- Victor Luchangco, Mark Moir, Nir Shavit, SPAA 2003:314-323
- Obstruction-Free Synchronization: Double-Ended Queues as an Example.
- Maurice Herlihy, Victor Luchangco, Mark Moir, ICDCS 2003:522-529
- On the Uncontended Complexity of Consensus.
- Victor Luchangco, Mark Moir, Nir Shavit, DISC 2003:45-59
- Software transactional memory for dynamic-sized data structures.
- Maurice Herlihy, Victor Luchangco, Mark Moir, William Scherer III, PODC 2003:92-101
- Space and Time Adaptive Non-blocking Algorithms.
- Maurice Herlihy, Victor Luchangco, Mark Moir, Electr. Notes Theor. Comput. Sci. (ENTCS) 78:260-280 (2003)
- DCAS-Based Concurrent Deques.
- Ole Agesen, David Detlefs, Christine Flood, Alexander Garthwaite, Paul Martin, Mark Moir, Nir Shavit, Guy Steele Jr., Theory Comput. Syst. (MST) 35(3):349-386 (2002)
- DCAS-based Concurrent Deques Supporting Bulk Allocation
- Mark Moir, Guy Steele, Paul Martin, Technical Report, (2002)
- Dynamic-sized Lockfree Data Structures
- Victor Luchangco, Paul Martin, Mark Moir, Maurice Herlihy, Technical Report, (2002)
- Dynamic-sized lock-free data structures.
- Maurice Herlihy, Victor Luchangco, Paul Martin, Mark Moir, PODC 2002:131
- Lock-free reference counting.
- David Detlefs, Paul Martin, Mark Moir, Guy Steele Jr., Distributed Computing (DC) 15(4):255-271 (2002)
- Repeat Offender Problem: A Mechanism for Supporting Dynamic-sized Lock-free Data Structures, The
- Maurice Herlihy, Victor Luchangco, Mark Moir, Technical Report, (2002)
- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures.
- Maurice Herlihy, Victor Luchangco, Mark Moir, DISC 2002:339-353
- A General Resource Allocation Synchronization Problem.
- Patrick Keane, Mark Moir, ICDCS 2001:557-564
- A Simple Local-Spin Group Mutual Exclusion Algorithm.
- Patrick Keane, Mark Moir, IEEE Trans. Parallel Distrib. Syst. (TPDS) 12(7):673-685 (2001)
- A simple proof technique for priority-scheduled systems.
- James Anderson, Mark Moir, Srikanth Ramamurthy, Inf. Process. Lett. (IPL) 77(2-4):63-70 (2001)
- Correction: practical implementations of non-blocking synchronization primitives.
- Mark Moir, PODC 2001:323
- Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions.
- Mark Moir, Distributed Computing (DC) 14(4):193-204 (2001)
- Lock-free reference counting.
- David Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele Jr., PODC 2001:190-199
- Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions.
- Mark Moir, PODC 2000:61-70
- Static-Priority Periodic Scheduling on Multiprocessors.
- Srikanth Rarnarnurthy, Mark Moir, RTSS 2000:69-78
- Static-Priority Periodic Scheduling on Multiprocessors.
- Srikanth Rarnarnurthy, Mark Moir, IEEE Real-Time Systems Symposium 2000:69-78
- netnice: nice is not only for CPUs-a simple subnetwork bandwidth management scheme.
- Takashi Okumura, Mark Moir, Daniel Mossé, ICCCN 2000:388-395
- A Simple Local-Spin Group Mutual Exclusion Algorithm.
- Patrick Keane, Mark Moir, PODC 1999:23-32
- Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources.
- Mark Moir, Srikanth Ramamurthy, RTSS 1999:294-303
- Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources.
- Mark Moir, Srikanth Ramamurthy, IEEE Real-Time Systems Symposium 1999:294-303
- Universal Constructions for Large Objects.
- James Anderson, Mark Moir, IEEE Trans. Parallel Distrib. Syst. (TPDS) 10(12):1317-1332 (1999)
- Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling.
- James Anderson, Mark Moir, PODC 1999:123-132
- Fast, Long-Lived Renaming Improved and Simplified.
- Mark Moir, Juan Garay, Sci. Comput. Program. (SCP) 30(3):287-308 (1998)
- Synchronization Mechanisms for SCRAMNet+ Systems.
- Stephen Menke, Mark Moir, Srikanth Ramamurthy, PODC 1998:71-80
- Practical Implementations of Non-Blocking Synchronization Primitives.
- Mark Moir, PODC 1997:219-228
- Transparent Support for Wait-Free Transactions.
- Mark Moir, WDAG 1997:305-319
- Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations.
- James Anderson, Mark Moir, Distributed Computing (DC) 11(1):1-20 (1997)
- Fast, Long-Lived Renaming Improved and Simplified (Abstract).
- Mark Moir, Juan Garay, PODC 1996:152
- Fast, Long-Lived Renaming Improved and Simplified.
- Mark Moir, Juan A. Garay, WDAG 1996:287-303
- Lock-Free Transactions for Real-Time Systems.
- James Anderson, Srikanth Ramamurthy, Mark Moir, Kevin Jeffay, RTDB 1996:103-110
- Real-Time Object Sharing with Minimal System Support (Extended Abstract).
- Srikanth Ramamurthy, Mark Moir, James Anderson, PODC 1996:233-242
- Long-Lived Renaming Made Fast.
- Harry Buhrman, Juan Garay, Jaap-Henk Hoepman, Mark Moir, PODC 1995:194-203
- Universal Constructions for Large Objects.
- James H. Anderson, Mark Moir, WDAG 1995:168-182
- Universal Constructions for Multi-Object Operations.
- James Anderson, Mark Moir, PODC 1995:184-193
- Wait-Free Algorithms for Fast, Long-Lived Renaming.
- Mark Moir, James Anderson, Sci. Comput. Program. (SCP) 25(1):1-39 (1995)
- Fast, Long-Lived Renaming (Extended Abstract).
- Mark Moir, James Anderson, WDAG 1994:141-155
- Using k-Exclusion to Implement Resilient, Scalable Shared Objects (Extended Abstract).
- James Anderson, Mark Moir, PODC 1994:141-150
- Towards a Necessary and Sufficient Condition for Wait-free Synchronization (Extended Abstract).
- James Anderson, Mark Moir, WDAG 1993:39-53
|