| United States Worldwide |
|
| United States Worldwide |
|
Conference PublicationsOn the Uncontended Complexity of ConsensusVictor Luchangco, Mark Moir, and Nir Shavit to appear in the International Conference on DIStributed Computing (DISC) 2003. Software Transactional Memory for Supporting Dynamic-Sized Data Structures Maurice Herlihy, Victor Luchangco, and Mark Moir ACM Symposium on Principles of Distributed Computing (PODC) 2003. Code available: see this page. Nonblocking $k$-Compare-Single-Swap Victor Luchangco, Mark Moir, and Nir Shavit ACM Symposium on Parallel Architectures and Algorithms (SPAA) 2003. Obstruction-Free Synchronization: Double-Ended Queues as an Example Maurice Herlihy, Victor Luchangco, and Mark Moir International Conference on Distributed Computing Systems (ICDCS) 2003. Space- and Time-Adaptive Nonblocking Data Structures Maurice Herlihy, Victor Luchangco, and Mark Moir Proceedings of Computing: Australasian Theory Symposium (CATS) 2003. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-sized Lock-free Data Structures Maurice Herlihy, Victor Luchangco, Mark Moir Proceedings of DIStributed Computing conference (DISC), October 2002. Brief Announcement: Dynamic-Sized Lock-Free Data Structures Maurice Herlihy, Victor Luchangco, and Mark Moir Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, July 2002. DCAS-Based Concurrent Deques Ole Agesen, David L. Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul A. Martin, Mark Moir, Nir N. Shavit, and Guy L. Steele Jr. Theory of Computing Systems, 35, 2002. On-line appendix: mechanical proof of correctness. Lock-Free Reference Counting David L. Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele Jr. ACM Symposium on Principles of Distributed Computing, 2001. (See also the journal version.) A General Resource Allocation Synchronization Problem Patrick Keane and Mark Moir Proceedings of the 21st International Conference on Distributed Computing Systems, April 2001. Static-Priority Periodic Scheduling on Multiprocessors Mark Moir and Srikanth Ramamurthy Proceedings of the 21st Annual IEEE Real-Time Systems Symposium, December 2000. Netnice: nice is not just for CPUs (A Per-Process Subnetwork Bandwidth Management Scheme) Takashi Okumura, Mark Moir, and Daniel Mosse Proceedings of the 9th IEEE International Conference on Computer Communications and Networks, October 2000. Static-Priority Periodic Scheduling on Multiprocessors Srikanth Ramamurthy and Mark Moir Proceedings of the 21st Annual IEEE Real-Time Systems Symposium, December 2000. Laziness Pays! Using Lazy Synchronization Mechanisms to Improve Non-Blocking Constructions Mark Moir Proceedings of the 19th Annual ACM Symposium on the Principles of Distributed Computing, Portland, OR, July 2000. (See also the tech report TR-00-01.) Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources Mark Moir and Srikanth Ramamurthy Proceedings of the 20th Annual IEEE Real-Time Systems Symposium, Phoenix, AZ, December 1999. (See also the journal version and the tech report TR-99-18.) Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling James H. Anderson and Mark Moir Proceedings of the 18th Annual ACM Symposium on the Principles of Distributed Computing, Atlanta, GA, May 1999. Synchronization Mechanisms for SCRAMNet+ Systems Steve Menke, Mark Moir, and Srikanth Ramamurthy Proceedings of the 17th Annual Symposium on the Principles of Distributed Computing, Puerto Vallarta, Mexico, July 1998. Transparent Support for Wait-Free Transactions Mark Moir Proceedings of the 11th International Workshop on Distributed Algorithms, Saarbrucken, Germany, September 1997. Practical Implementations of Non-Blocking Synchronization Primitives Mark Moir Proceedings of the 16th Annual ACM Symposium on the Principles of Distributed Computing, Santa Barbara, CA August 1997. Fast, Long-Lived Renaming Improved and Simplified Mark Moir and Juan Garay Proceedings of the 10th International Workshop on Distributed Algorithms, Bologna, Italy, October 1996. A brief announcement appeared in the 15th Annual ACM Symposium on the Principles of Distributed Computing, May 1996. (See also the journal version.) Real-Time Object Sharing with Minimal System Support Srikanth Ramamurthy, Mark Moir, and James H. Anderson Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, May 1996. Lock-Free Transactions for Real-Time Systems James H. Anderson, Srikanth Ramamurthy, Mark Moir, and Kevin Jeffay Proceedings of the First International Workshop on Real-Time Databases: Issues and Applications, Newport Beach, CA, March 1996. Universal Constructions for Large Objects James Anderson and Mark Moir Proceedings of the Ninth International Workshop on Distributed Algorithms, September 1995, pp.168-182. Universal Constructions for Multi-Object Operations James H. Anderson and Mark Moir Proceedings of the 14th Annual ACM Symposium on the Principles of Distributed Computing, Ottawa, Canada, August 1995. Long-Lived Renaming Made Fast Harry Buhrman, Juan Garay, Jaap-Henk Hoepman, and Mark Moir Proceedings of the 14th Annual ACM Symposium on the Principles of Distributed Computing, Ottawa, Canada, August 1995. Fast, Long-Lived Renaming Mark Moir and James H. Anderson Proceedings of the Eighth International Workshop on Distributed Algorithms, Tercshelling, the Netherlands, September 1994 (See also the journal version.) Using k-Exclusion to Implement Resilient, Scalable Shared Objects James H. Anderson and Mark Moir Proceedings of the 13th Annual ACM Symposium on the Principles of Distributed Computing, Los Angeles, USA, August 1994 (See also the journal version.) Towards A Necessary and Sufficient Condition for Wait-Free Synchronization James H. Anderson and Mark Moir Proceedings of the Seventh International Workshop on Distributed Algorithms, Lausanne, Switzerland, September 1993. Journal PublicationsLock-Free Reference CountingDavid L. Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele Jr. Distributed Computing, 15(4), 2001. A Simple Proof Technique for Priority-scheduled Systems James Anderson, Mark Moir, and Srikanth Ramamurthy Information Processing Letters, Volume 77, Number 2-4, pp. 63-70, February 28, 2001. A Simple, Local-Spin Group Mutual Exclusion Algorithm Patrick Keane and Mark Moir IEEE Transactions on Parallel and Distributed Systems, December 1999. (See also the tech report TR-99-04 and the conference version.) Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources Mark Moir and Srikanth Ramamurthy Real Time Systems, September 1999. (See also the conference version and the tech report TR-99-18. Universal Constructions for Large Objects James H. Anderson and Mark Moir IEEE Transactions on Parallel and Distributed Systems, 10(12), 1999. (See also the conference version.) Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations James H. Anderson and Mark Moir Distributed Computing 11(1), 1997. (See also the conference version.) Wait-Free Algorithms for Fast, Long-Lived Renaming Mark Moir and James H. Anderson Science of Computer Programming 25, 1995. (See also the conference version.) Technical ReportsThe Repeat Offender Problem: A Mechanism for Supporting Dynamic-sized Lock-free Data StructuresMaurice Herlihy, Victor Luchangco and Mark Moir Sun Microsystems Laboratories Technical Report Number: TR-2002-112. DCAS-based Concurrent Deques Supporting Bulk Allocation Paul Martin, Mark Moir and Guy L. Steele Jr. Sun Microsystems Laboratories Technical Report Number: TR-2002-111. Dynamic-sized Lockfree Data Structures Maurice Herlihy, Victor Luchangco, Paul Martin and Mark Moir Sun Microsystems Laboratories Technical Report Number: TR-2002-110. Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources Mark Moir and Srikanth Ramamurthy University of Pittsburgh Department of Computer Science technical report, TR-99-18, 1999. (See also the journal version and the conference version. Book Chapter(s)Lock-Free Transactions for Real-Time SystemsJames H. Anderson, Srikanth Ramamurthy, Mark Moir, and Kevin Jeffay in Real-Time Database Systems: Issues and Applications, A. Bestavros, K.J. Lin, and S.H. Son, (eds.), Kluwer Academic Publishers, Norwell, Massachusetts. DissertationEfficient Object Sharing in Shared-Memory MultiprocessorsMark Moir Ph.D. Thesis, University of North Carolina at Chapel Hill, 1996. | ||||||||||||||||||||||||
