skip to main content
10.1145/2332432.2332480acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
abstract

Brief announcement: From sequential to concurrent: correctness and relative efficiency

Published: 16 July 2012 Publication History

Abstract

No abstract available.

References

[1]
R. Bayer and M. Schkolnick. Readings in database systems. pages 129--139, San Francisco, CA, USA, 1988. Morgan Kaufmann Publishers Inc.
[2]
V. Gramoli, D. Harmanci, and P. Felber. On the input acceptance of transactional memory. Parallel Processing Letters, 20(1):31--50, 2010.
[3]
V. Gramoli, P. Kuznetsov, and S. Ravi. From sequential to concurrent: Correctness and relative efficiency. CoRR, abs/1203.4751, 2012.
[4]
M. Herlihy. SXM: C# software transactional memory, 2005. www.cs.brown.edu/mph/SXM/README.doc.
[5]
M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer, III. Software transactional memory for dynamic-sized data structures. In PODC, pages 92--101, 2003.
[6]
M. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463--492, 1990.
[7]
D. Perelman, R. Fan, and I. Keidar. On maintaining multiple versions in STM. In PODC, pages 16--25, 2010.

Cited By

View all
  • (2017)A Concurrency-Optimal Binary Search TreeEuro-Par 2017: Parallel Processing10.1007/978-3-319-64203-1_42(580-593)Online publication date: 1-Aug-2017
  • (2012)WTTM 2012, the fourth workshop on the theory of transactional memoryACM SIGACT News10.1145/2421119.242114143:4(116-122)Online publication date: 19-Dec-2012

Index Terms

  1. Brief announcement: From sequential to concurrent: correctness and relative efficiency

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computing
    July 2012
    410 pages
    ISBN:9781450314503
    DOI:10.1145/2332432

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 16 July 2012

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. concurrency
    2. synchronization

    Qualifiers

    • Abstract

    Conference

    PODC '12
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)A Concurrency-Optimal Binary Search TreeEuro-Par 2017: Parallel Processing10.1007/978-3-319-64203-1_42(580-593)Online publication date: 1-Aug-2017
    • (2012)WTTM 2012, the fourth workshop on the theory of transactional memoryACM SIGACT News10.1145/2421119.242114143:4(116-122)Online publication date: 19-Dec-2012

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media