Projects

Scalable Synchronization

Exploration of hardware and software techniques for making it easier to develop scalable and correct concurrent programs

Primary Research Category: System Science  

For more information

Principal Investigator: Mark Moir  
  • Scalable Synchronization Project Pages



    Project Overview

    This is the "official" Scalable Synchronization Research Group page. Please check out our less-official-but-much-more-informative page too.

    Typical concurrent software systems rely on coarse-grained locking for correct semantics, but that approach does not scale. Addressing this problem with finer grained locks is difficult and error prone. We are exploring hardware and software support for making it easier to develop concurrent programs that are scalable, efficient, and correct.

    We have a special focus on transactional memory (TM). We have made significant contributions to the state of the art in software transactional memory (STM), and have also shown that transactional memory can be supported through a hybrid of STM and "best effort" HTM. We believe this approach can provide almost all of the benefit of alternative "unbounded" hardware transactional memory proposals, but with much simpler hardware support. Our collaboration with Sun product groups has led to support for a form of best-effort HTM in Sun's forthcoming Rock processor. An important current focus of our work is on mechanisms for exploiting this feature, both in ways that are transparent to programmers, and in integrating support for explicit transactional programming into various languages and environments.

    We also have strong expertise in the design and verification of scalable concurrent data structures.


    Technical Reports

  • Early Experience with a Commercial Hardware Transactional Memory Implementation
    By: David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum and Marek Olszewski
    Report Number: TR-2009-180
    Oct 26, 2009
  • DCAS-based Concurrent Deques Supporting Bulk Allocation
    By: Mark Moir, Guy Steele and Paul Martin
    Report Number: TR-2002-111
    Oct 1, 2002
  • Repeat Offender Problem: A Mechanism for Supporting Dynamic-sized Lock-free Data Structures, The
    By: Maurice Herlihy, Victor Luchangco and Mark Moir
    Report Number: TR-2002-112
    Jul 1, 2002
  • Dynamic-sized Lockfree Data Structures
    By: Victor Luchangco, Paul Martin, Mark Moir and Maurice Herlihy
    Report Number: TR-2002-110
    Jun 1, 2002

    Latest Sun Patents

  • Methods and apparatus to implement parallel transactions
    (Dec 29, 2009)
  • Adaptive spin-then-block mutual exclusion in multi-threaded processing
    (Sep 22, 2009)
  • Space-adaptive lock-free queue using pointer-sized single-target synchronization
    (Aug 18, 2009)
  • Space-adaptive lock-free free-list using pointer-sized single-target synchronization
    (May 12, 2009)
  • System and method for executing nested atomic blocks using split hardware transactions
    (Apr 7, 2009)
    See all 30 patents »

    News

  • Sun Labs Open House - Scalable Switch Architectures
    Sun Microsystems

  • Computer-Chip Makers Pick Up Pace in Multicore Race
    Wall Street Journal


    Team Members

    Mark Moir
    Steve Heller
    Maurice Herlihy
    Victor Luchangco
    Kevin Moore
    Dan Nussbaum
    Nir Shavit