Cited By
View all- Dhulipala LMcGuffey CKang HGu YBlelloch GGibbons PShun J(2020)SageProceedings of the VLDB Endowment10.14778/3397230.339725113:9(1598-1613)Online publication date: 1-May-2020
Optimizing Persistent Transactions (Brief Announcement)
Pages 169 - 170
Abstract
There is a mechanical transformation by which algorithms for software transactional memory can be transformed to work with persistent memory. While correct, this transformation does not take into account differences between the persistent and volatile programming models. We show that fundamental properties of the data regions accessed by a persistent software transaction allow for a variety of optimizations not available in the volatile setting, and these lead to significant performance gains.
References
[1]
Luke Dalessandro, Michael Spear, and Michael L. Scott. 2010. NOrec: Streamlining STM by Abolishing Ownership Records. In Proceedings of the 15th PPoPP. Bangalore, India.
[2]
Joel Coburn et al. 2011. NV-Heaps: Making Persistent Objects Fast and Safe with Next-generation, Non-volatile Memories. In Proceedings of the Sixteenth ASPLOS. New York, NY, USA.
[3]
Mengxing Liu et al. 2017. DudeTM: Building Durable Transactions with Decoupling for Persistent Memory. In Proceedings of the 22nd ASPLOS. Xi'an, China.
[4]
Michael Spear et al. 2008. Implementing and Exploiting Inevitability in Software Transactional Memory. In Proceedings of the 37th ICPP. Portland, OR.
[5]
Michael Spear et al. 2008. RingSTM: Scalable Transactions with a Single Atomic Instruction. In Proceedings of the 20th SPAA. Munich, Germany.
[6]
Pascal Felber et al. 2008. Dynamic Performance Tuning of Word-Based Software Transactional Memory. In Proceedings of the 13th PPoPP. Salt Lake City, UT.
[7]
Richard Yoo et al. 2008. Kicking the Tires of Software Transactional Memory: Why the Going Gets Tough. In Proceedings of the 20th SPAA. Munich, Germany.
[8]
Maurice P. Herlihy and J. Eliot B. Moss. 1993. Transactional Memory: Architectural Support for Lock-Free Data Structures. In Proceedings of the 20th ISCA. San Diego, CA.
[9]
Chi Cao Minh, JaeWoong Chung, Christos Kozyrakis, and Kunle Olukotun. 2008. STAMP: Stanford Transactional Applications for Multi-processing. In Proceedings of IISWC. Seattle, WA.
[10]
Newsroom, Intel. 2018. Intel and Micron produce breakthrough memory technology. https://www.intel.com/content/www/us/en/architecture-and-technology/intel-optane-technology.html.
[11]
Haris Volos, Andres Jaan Tack, and Michael M. Swift. 2011. Mnemosyne: Lightweight persistent memory. In ACM SIGARCH Computer Architecture News.
Index Terms
- Optimizing Persistent Transactions (Brief Announcement)
Recommendations
Optimizing Persistent Memory Transactions
PACT '19: Proceedings of the International Conference on Parallel Architectures and Compilation TechniquesByte-addressable, non-volatile, random access memory (NVM) has the potential to dramatically accelerate the performance of storage-intensive workloads. For applications with irregular data access patterns, and applications that rely on ad-hoc data ...
Brief announcement: on enhancing concurrency in distributed transactional memory
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingDistributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase concurrency, we ...
Brief Announcement: Extending Transactional Memory with Atomic Deferral
SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and ArchitecturesAtomic deferral is a language-level mechanism for transactional memory (TM) that enables programmers to move output and long-running operations out of a transaction's body without sacrificing serializability: the deferred operation appears to execute as ...
Comments
Information & Contributors
Information
Published In
June 2019
410 pages
ISBN:9781450361842
DOI:10.1145/3323165
- General Chair:
- Christian Scheideler,
- Program Chair:
- Petra Berenbrink
Copyright © 2019 Owner/Author.
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
In-Cooperation
- EATCS: European Association for Theoretical Computer Science
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2019
Check for updates
Author Tags
Qualifiers
- Announcement
Funding Sources
- Intel and NSF joint research center for Computer Assisted Programming for Heterogeneous Architectures (CAPA)
- Grant CAREER
Conference
SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures
June 22 - 24, 2019
AZ, Phoenix, USA
Acceptance Rates
SPAA '19 Paper Acceptance Rate 34 of 109 submissions, 31%;
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 127Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
Cited By
View all- Dhulipala LMcGuffey CKang HGu YBlelloch GGibbons PShun J(2020)SageProceedings of the VLDB Endowment10.14778/3397230.339725113:9(1598-1613)Online publication date: 1-May-2020
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in