Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model

    This paper provides a theoretical and practical framework for crash-resilient data structures on a machine with persistent (nonvolatile) memory but transient registers and cache. In contrast to certain prior w...

    Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott in Distributed Computing (2016)

  2. No Access

    Chapter and Conference Paper

    Transactions as the Foundation of a Memory Consistency Model

    We argue that traditional synchronization objects, such as locks, conditions, and atomic/volatile variables, should be defined in terms of transactions, rather than the other way around. A traditional critical se...

    Luke Dalessandro, Michael L. Scott, Michael F. Spear in Distributed Computing (2010)

  3. No Access

    Chapter and Conference Paper

    Preemption Adaptivity in Time-Published Queue-Based Spin Locks

    The proliferation of multiprocessor servers and multithreaded applications has increased the demand for high-performance synchronization. Traditional scheduler-based locks incur the overhead of a full context ...

    Bijun He, William N. Scherer III in High Performance Computing – HiPC 2005 (2005)