Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Ordering-Based Semantics for Software Transactional Memory

    It has been widely suggested that memory transactions should behave as if they acquired and released a single global lock. Unfortunately, this behavior can be expensive to achieve, particularly when—as in the ...

    Michael F. Spear, Luke Dalessandro in Principles of Distributed Systems (2008)

  2. 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)