• DocumentCode
    2479884
  • Title

    Software transactional memory: Where do we come from? What are we? Where are we going?

  • Author

    Shavit, Nir

  • Author_Institution
    Comput. Sci. Dept., Tel-Aviv Univ., Tel-Aviv, Israel
  • fYear
    2009
  • fDate
    23-29 May 2009
  • Firstpage
    1
  • Lastpage
    1
  • Abstract
    The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming. Combining sequences of concurrent operations into atomic transactions seems to promise a great reduction in the complexity of both programming and verification, by making parts of the code appear to be sequential without the need to program fine-grained locks. Software transactional memory offers to deliver a transactional programming environment without the need for costly modifications in processor design. However, the story of software transactional memory reminds one of garbage collection in its time: performance is improving, and the semantics are becoming clearer, yet there is still a long road ahead, a road strewn with stones below and crows hovering above, predicting its demise. This talk will try to take a sober look at software transactional memory, its history, the state of research today, and what we can expect to achieve it in the foreseeable future.
  • Keywords
    parallel programming; storage management; transaction processing; complexity reduction; concurrent programming; fine grained locks; garbage collection; processor design; software transactional memory; transactional memory programming paradigm; transactional programming environment; Computer industry; Computer science; Concurrent computing; History; Process design; Programming environments; Roads; Software performance; Software systems; Sun;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on
  • Conference_Location
    Rome
  • ISSN
    1530-2075
  • Print_ISBN
    978-1-4244-3751-1
  • Electronic_ISBN
    1530-2075
  • Type

    conf

  • DOI
    10.1109/IPDPS.2009.5160860
  • Filename
    5160860