2009 | ||
---|---|---|
57 | EE | David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum: Early experience with a commercial hardware transactional memory implementation. ASPLOS 2009: 157-168 |
2008 | ||
56 | EE | Virendra J. Marathe, Mark Moir: Toward high performance nonblocking software transactional memory. PPOPP 2008: 227-236 |
55 | EE | Mark Moir, Kevin Moore, Daniel Nussbaum: The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster). SPAA 2008: 362 |
54 | EE | Mark Moir: Wait-Free Synchronization. Encyclopedia of Algorithms 2008 |
2007 | ||
53 | EE | Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir: SNZI: scalable NonZero indicators. PODC 2007: 13-22 |
52 | EE | Virendra J. Marathe, Mark Moir: Efficient nonblocking software transactional memory. PPOPP 2007: 136-137 |
51 | EE | Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit: A Lazy Concurrent List-Based Set Algorithm. Parallel Processing Letters 17(4): 411-424 (2007) |
2006 | ||
50 | EE | Peter Damron, Alexandra Fedorova, Yossi Lev, Victor Luchangco, Mark Moir, Daniel Nussbaum: Hybrid transactional memory. ASPLOS 2006: 336-346 |
49 | EE | Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir: Formal Verification of a Lazy Concurrent List-Based Set Algorithm. CAV 2006: 475-488 |
48 | EE | Virendra J. Marathe, Mark Moir, Nir Shavit: Composite Abortable Locks. IPDPS 2006: 1-10 |
47 | EE | Maurice Herlihy, Victor Luchangco, Mark Moir: A flexible framework for implementing software transactional memory. OOPSLA 2006: 253-262 |
46 | EE | Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit: A dynamic-sized nonblocking work stealing deque. Distributed Computing 18(3): 189-207 (2006) |
2005 | ||
45 | EE | Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit: Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. DISC 2005: 493-494 |
44 | EE | Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit: Obstruction-Free Algorithms Can Be Practically Wait-Free. DISC 2005: 78-92 |
43 | EE | Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit: A Lazy Concurrent List-Based Set Algorithm. OPODIS 2005: 3-16 |
42 | EE | Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit: Using elimination to implement scalable and lock-free FIFO queues. SPAA 2005: 253-262 |
41 | EE | Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir: Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst. 23(2): 146-196 (2005) |
40 | EE | Mark Moir, Nir Shavit, Jan Vitek: Concurrency and synchronization in Java programs. Sci. Comput. Program. 58(3): 291-292 (2005) |
2004 | ||
39 | EE | Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir: Formal Verification of a Practical Lock-Free Queue Algorithm. FORTE 2004: 97-114 |
38 | EE | Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir: Bringing practical lock-free synchronization to 64-bit applications. PODC 2004: 31-39 |
37 | EE | Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.: DCAS is not a silver bullet for nonblocking algorithm design. SPAA 2004: 216-224 |
2003 | ||
36 | EE | Victor Luchangco, Mark Moir, Nir Shavit: On the Uncontended Complexity of Consensus. DISC 2003: 45-59 |
35 | EE | Maurice Herlihy, Victor Luchangco, Mark Moir: Obstruction-Free Synchronization: Double-Ended Queues as an Example. ICDCS 2003: 522-529 |
34 | EE | Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III: Software transactional memory for dynamic-sized data structures. PODC 2003: 92-101 |
33 | EE | Victor Luchangco, Mark Moir, Nir Shavit: Nonblocking k-compare-single-swap. SPAA 2003: 314-323 |
32 | EE | Maurice Herlihy, Victor Luchangco, Mark Moir: Space and Time Adaptive Non-blocking Algorithms. Electr. Notes Theor. Comput. Sci. 78: (2003) |
2002 | ||
31 | EE | Maurice Herlihy, Victor Luchangco, Mark Moir: The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. DISC 2002: 339-353 |
30 | EE | Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir: Dynamic-sized lock-free data structures. PODC 2002: 131 |
29 | EE | David Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele Jr.: Lock-free reference counting. Distributed Computing 15(4): 255-271 (2002) |
28 | EE | Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.: DCAS-Based Concurrent Deques. Theory Comput. Syst. 35(3): 349-386 (2002) |
2001 | ||
27 | EE | Patrick Keane, Mark Moir: A General Resource Allocation Synchronization Problem. ICDCS 2001: 557-564 |
26 | EE | David Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele Jr.: Lock-free reference counting. PODC 2001: 190-199 |
25 | EE | Mark Moir: Correction: practical implementations of non-blocking synchronization primitives. PODC 2001: 323 |
24 | EE | Mark Moir: Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. Distributed Computing 14(4): 193-204 (2001) |
23 | EE | Patrick Keane, Mark Moir: A Simple Local-Spin Group Mutual Exclusion Algorithm. IEEE Trans. Parallel Distrib. Syst. 12(7): 673-685 (2001) |
22 | EE | James H. Anderson, Mark Moir, Srikanth Ramamurthy: A simple proof technique for priority-scheduled systems. Inf. Process. Lett. 77(2-4): 63-70 (2001) |
2000 | ||
21 | EE | Mark Moir: Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions. PODC 2000: 61-70 |
1999 | ||
20 | EE | Mark Moir, Srikanth Ramamurthy: Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources. IEEE Real-Time Systems Symposium 1999: 294-303 |
19 | EE | James H. Anderson, Mark Moir: Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling. PODC 1999: 123-132 |
18 | EE | Patrick Keane, Mark Moir: A Simple Local-Spin Group Mutual Exclusion Algorithm. PODC 1999: 23-32 |
17 | EE | James H. Anderson, Mark Moir: Universal Constructions for Large Objects. IEEE Trans. Parallel Distrib. Syst. 10(12): 1317-1332 (1999) |
1998 | ||
16 | EE | Stephen Menke, Mark Moir, Srikanth Ramamurthy: Synchronization Mechanisms for SCRAMNet+ Systems. PODC 1998: 71-80 |
15 | Mark Moir: Fast, Long-Lived Renaming Improved and Simplified. Sci. Comput. Program. 30(3): 287-308 (1998) | |
1997 | ||
14 | Mark Moir: Practical Implementations of Non-Blocking Synchronization Primitives. PODC 1997: 219-228 | |
13 | Mark Moir: Transparent Support for Wait-Free Transactions. WDAG 1997: 305-319 | |
12 | EE | James H. Anderson, Mark Moir: Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations. Distributed Computing 11(1): 1-20 (1997) |
1996 | ||
11 | Mark Moir, Juan A. Garay: Fast, Long-Lived Renaming Improved and Simplified (Abstract). PODC 1996: 152 | |
10 | Srikanth Ramamurthy, Mark Moir, James H. Anderson: Real-Time Object Sharing with Minimal System Support (Extended Abstract). PODC 1996: 233-242 | |
9 | EE | James H. Anderson, Srikanth Ramamurthy, Mark Moir, Kevin Jeffay: Lock-Free Transactions for Real-Time Systems. RTDB 1996: 103-110 |
8 | Mark Moir, Juan A. Garay: Fast, Long-Lived Renaming Improved and Simplified. WDAG 1996: 287-303 | |
1995 | ||
7 | James H. Anderson, Mark Moir: Universal Constructions for Multi-Object Operations. PODC 1995: 184-193 | |
6 | Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman, Mark Moir: Long-Lived Renaming Made Fast. PODC 1995: 194-203 | |
5 | James H. Anderson, Mark Moir: Universal Constructions for Large Objects. WDAG 1995: 168-182 | |
4 | Mark Moir, James H. Anderson: Wait-Free Algorithms for Fast, Long-Lived Renaming. Sci. Comput. Program. 25(1): 1-39 (1995) | |
1994 | ||
3 | James H. Anderson, Mark Moir: Using k-Exclusion to Implement Resilient, Scalable Shared Objects (Extended Abstract). PODC 1994: 141-150 | |
2 | Mark Moir, James H. Anderson: Fast, Long-Lived Renaming (Extended Abstract). WDAG 1994: 141-155 | |
1993 | ||
1 | James H. Anderson, Mark Moir: Towards a Necessary and Sufficient Condition for Wait-free Synchronization (Extended Abstract). WDAG 1993: 39-53 |