Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3670684.3673411acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
poster

Last-Use Opacity: A Strong Safety Property for Transactional Memory with Prerelease Support (Abstract)

Published: 26 July 2024 Publication History

Abstract

Transaction Memory (TM) is a concurrency control abstraction that allows the programmer to specify blocks of code to be executed atomically as transactions. However, since transactional code can contain just about any operation attention must be paid to the state of shared variables at any given time. E.g., contrary to a database transaction, if a TM transaction reads a stale value it may execute dangerous operations, like attempt to divide by zero, access an illegal memory address, or enter an infinite loop. Thus serializability is insufficient, and stronger safety properties are required in TM, which regulate what values can be read, even by transactions that abort. Hence, a number of TM safety properties were developed, including opacity, and TMS1 and TMS2.
However, such strong properties preclude using prerelease as a technique for parallelizing TM, because they virtually forbid reading from live transactions. Moreover, the newest applications of TM in parallelising smart contracts do not require opacity, since the system is isolated from the damaging effects of inconsistent views at the level of virtual machines (see also sandboxing). On the other hand, properties that do allow prerelease are either not strong enough to prevent any of the problems mentioned above (e.g., recoverability, or add additional conditions on transactions that prerelease variables that limit their applicability (e.g., elastic opacity, live opacity, virtual world consistency). In a paper published in Distributed Computing, Vol. 35, 3 (2022), we proposed last-use opacity---a new TM safety property meant to be a compromise between strong properties like opacity and minimal ones like serializability. The property eliminates all but a small class of benign inconsistent views and poses no stringent conditions on transactions. In this extended abstract, we briefly describe the property and main results.

References

[1]
Bieniusa, A., Middelkoop, A., and Thiemann, P. Brief announcement: Actions in the Twilight-Concurrent irrevocable transactions and inconsistency repair. In Proc of PODC'10 (July 2010).
[2]
Dalessandro, L., and Scott, M. L. Sandboxing transactional memory. In Proc of PACT'12 (2012).
[3]
Doherty, S., Groves, L., Luchangco, V., and Moir, M. Towards formally specifying and verifying transactional memory. Formal Aspects of Computing 25, 5 (Sept. 2013), 769--799.
[4]
Dziuma, D., Fatourou, P., and Kanellou, E. Consistency for transactional memory computing. Bulletin of the EATCS 113 (2014).
[5]
Felber, P., Gramoli, V., and Guerraoui, R. Elastic transactions. In Proc of DISC'09 (Sept. 2009).
[6]
Guerraoui, R., and Kapa?ka, M. On the correctness of transactional memory. In Proc. of PPoPP '08 (Feb. 2008).
[7]
Hadzilacos, V. A theory of reliability in database systems. Journal of the ACM 35, 1 (Jan. 1988), 121--145.
[8]
Imbs, D., and Raynal, M. Virtual World Consistency: A Condition for STM Systems (with a Versatile Protocol with Invisible Read Operations). Theoretical Computer Science 444 (July 2012), 113--127.
[9]
Kobyli ´ nski, P., Siek, K., Baranowski, J., and Wojciechowski, P. T. Helenos: A realistic benchmark for distributed transactional memory. Journal of Software: Practice and Experience 48, 3 (Mar. 2018), 528--549.
[10]
Papadimitrou, C. H. The serializability of concurrent database updates. Journal of the ACM 26, 4 (1979), 631--653.
[11]
Saad, M. M., Kishi, M. J., Jing, S., Hans, S., and Palmieri, R. Processing transactions in a predefined order. In Proc. of PPoPP '19 (2019).
[12]
Siek, K., and Wojciechowski, P. T. Atomic RMI 2: Highly parallel pessimistic distributed transactional memory. CoRR abs/1606.03928 (June 2016).
[13]
Siek, K., and Wojciechowski, P. T. Atomic RMI: a distributed transactional memory framework. International Journal of Parallel Programming 44, 3 (June 2016), 598--619.
[14]
Siek, K., and Wojciechowski, P. T. Last-use opacity: A strong safety property for transactional memory with prerelease support. Distributed Computing 35, 3 (2022), 265--301. Published: 17 April 2022.

Index Terms

  1. Last-Use Opacity: A Strong Safety Property for Transactional Memory with Prerelease Support (Abstract)

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    HOPC'24: Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing
    June 2024
    47 pages
    ISBN:9798400707001
    DOI:10.1145/3670684
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 26 July 2024

    Check for updates

    Author Tags

    1. consistency
    2. safety property
    3. transactional memory

    Qualifiers

    • Poster

    Funding Sources

    • Polish National Science Centre
    • Czech Ministry of Education, Youth, and Sports

    Conference

    SPAA '24
    Sponsor:

    Upcoming Conference

    SPAA '25
    37th ACM Symposium on Parallelism in Algorithms and Architectures
    July 28 - August 1, 2025
    Portland , OR , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 21
      Total Downloads
    • Downloads (Last 12 months)21
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 13 Feb 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media