The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Mark Moir: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  53. Early experience with a commercial hardware transactional memory implementation. [Citation Graph (, )][DBLP]


  54. Toward high performance nonblocking software transactional memory. [Citation Graph (, )][DBLP]


  55. Static-Priority Periodic Scheduling on Multiprocessors. [Citation Graph (, )][DBLP]


  56. The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster). [Citation Graph (, )][DBLP]


  57. NZTM: nonblocking zero-indirection transactional memory. [Citation Graph (, )][DBLP]


  58. Simplifying concurrent algorithms by exploiting hardware transactional memory. [Citation Graph (, )][DBLP]


  59. Nonblocking Algorithms and Backward Simulation. [Citation Graph (, )][DBLP]


Search in 0.032secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002