Skip to content

Mark Moir

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

48

Venues

17

Active years

1994–2021

Best venue rank

A*

Where they publish

Papers

48 indexed papers, newest first.

YearVenueTitleAuthors
2021CPPFormal verification of authenticated, append-only skip lists in Agda.Victor Cacciari Miraldo, Harold Carr, Mark Moir, Lisandra Silva, Guy L. Steele Jr.
2018ICFPAuthenticated modular maps in Haskell.Victor Cacciari Miraldo, Harold Carr, Alex Kogan, Mark Moir, Maurice Herlihy
2016LICSBlockchains and the Logic of Accountability: Keynote Address.Maurice Herlihy, Mark Moir
2014SPAAAdaptive integration of hardware and software lock elision techniques.Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir
2013OPODISMessage 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
2013PPoPPUsing hardware transactional memory to correct and simplify and readers-writer lock algorithm.Dave Dice, Yossi Lev, Yujie Liu, Victor Luchangco, Mark Moir
2013PPoPPScalable statistics counters.Dave Dice, Yossi Lev, Mark Moir
2013SPAAScalable statistics counters.Dave Dice, Yossi Lev, Mark Moir
2012CONCURA Framework for Formally Verifying Software Transactional Memory Algorithms.Mohsen Lesani, Victor Luchangco, Mark Moir
2011ASPLOSHybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory.Luke Dalessandro, Franois Carouge, Sean White, Yossi Lev, Mark Moir, Michael L. Scott, Michael F. Spear
2011ICSELightweight parallel accumulators using C++ templates.Yossi Lev, Mark Moir
2011PODCOn the power of hardware transactional memory to simplify memory management.Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir
2010ISCAWhat Kinds of Applications Can Benefit from Transactional Memory?Mark Moir, Daniel Nussbaum
2010SPAASimplifying concurrent algorithms by exploiting hardware transactional memory.David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski
2009ASPLOSEarly experience with a commercial hardware transactional memory implementation.David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum
2009SPAANZTM: nonblocking zero-indirection transactional memory.Fuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, Cong Wang
2008PPoPPToward high performance nonblocking software transactional memory.Virendra J. Marathe, Mark Moir
2008SPAAThe adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster).Mark Moir, Kevin Moore, Daniel Nussbaum
2007PODCSNZI: scalable NonZero indicators.Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir
2007PPoPPEfficient nonblocking software transactional memory.Virendra J. Marathe, Mark Moir
2006ASPLOSHybrid transactional memory.Peter Damron, Alexandra Fedorova, Yossi Lev, Victor Luchangco, Mark Moir, Daniel Nussbaum
2006CAVFormal Verification of a Lazy Concurrent List-Based Set Algorithm.Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir
2006OOPSLAA flexible framework for implementing software transactional memory.Maurice Herlihy, Victor Luchangco, Mark Moir
2005OPODISA Lazy Concurrent List-Based Set Algorithm.Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit
2005SPAAUsing elimination to implement scalable and lock-free FIFO queues.Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit
2004FORTEFormal Verification of a Practical Lock-Free Queue Algorithm.Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir
2004PODCBringing practical lock-free synchronization to 64-bit applications.Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir
2004SPAADCAS is not a silver bullet for nonblocking algorithm design.Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.
2003ICDCSObstruction-Free Synchronization: Double-Ended Queues as an Example.Maurice Herlihy, Victor Luchangco, Mark Moir
2003PODCSoftware transactional memory for dynamic-sized data structures.Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III
2003SPAANonblocking k-compare-single-swap.Victor Luchangco, Mark Moir, Nir Shavit
2002PODCDynamic-sized lock-free data structures.Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
2001ICDCSA General Resource Allocation Synchronization Problem.Patrick Keane, Mark Moir
2001PODCLock-free reference counting.David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr.
2001PODCCorrection: practical implementations of non-blocking synchronization primitives.Mark Moir
2000ICCCNnetnice: nice is not only for CPUs-a simple subnetwork bandwidth management scheme.Takashi Okumura, Mark Moir, Daniel Moss
2000PODCLaziness pays! using lazy synchronization mechanisms to improve non-blocking constructions.Mark Moir
2000RTSSStatic-Priority Periodic Scheduling on Multiprocessors.Srikanth Rarnarnurthy, Mark Moir
1999PODCWait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling.James H. Anderson, Mark Moir
1999PODCA Simple Local-Spin Group Mutual Exclusion Algorithm.Patrick Keane, Mark Moir
1999RTSSPfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources.Mark Moir, Srikanth Ramamurthy
1998PODCSynchronization Mechanisms for SCRAMNet+ Systems.Stephen Menke, Mark Moir, Srikanth Ramamurthy
1997PODCPractical Implementations of Non-Blocking Synchronization Primitives.Mark Moir
1996PODCFast, Long-Lived Renaming Improved and Simplified (Abstract).Mark Moir, Juan A. Garay
1996PODCReal-Time Object Sharing with Minimal System Support (Extended Abstract).Srikanth Ramamurthy, Mark Moir, James H. Anderson
1995PODCUniversal Constructions for Multi-Object Operations.James H. Anderson, Mark Moir
1995PODCLong-Lived Renaming Made Fast.Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman, Mark Moir
1994PODCUsing k-Exclusion to Implement Resilient, Scalable Shared Objects (Extended Abstract).James H. Anderson, Mark Moir