English
Related papers

Related papers: A TimeStamp based Multi-version STM Protocol that …

200 papers

Opacity of Transactional Memory is proposed to be established by incremental validation. Quiescence in terms of epoch-based memory reclamation is applied to deal with doomed transactions causing memory access violations. This method…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-08-14 Holger Machens , Volker Turau

Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and write sets, an approach that often leads to false conflicts.…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-06-27 Thomas D. Dickerson , Paul Gazzillo , Maurice Herlihy , Eric Koskinen

The Software Transactional Memory (STM) model is an original approach for controlling concurrent accesses to ressources without the need for explicit lock-based synchronization mechanisms. A key feature of STM is to provide a way to group…

Logic in Computer Science · Computer Science 2007-05-23 Lucia Acciai , Michele Boreale , Silvano Dal Zilio

Multiversion Concurrency Control (MVCC) is a widely adopted concurrency control mechanism in database systems, which usually utilizes timestamps to resolve conflicts between transactions. However, centralized allocation of timestamps is a…

Databases · Computer Science 2018-06-06 Xuan Zhou , Xin Zhou , Zhengtai Yu , Hua Guo , Kian-Lee Tan

State-of-the-art \emph{software transactional memory (STM)} implementations achieve good performance by carefully avoiding the overhead of \emph{incremental validation} (i.e., re-reading previously read data items to avoid inconsistency)…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-08 Trevor Brown , Srivatsan Ravi

Transactional memory is a mechanism that manages thread synchronisation on behalf of a programmer so that blocks of code execute with an illusion of atomicity. The main safety criterion for transactional memory is opacity, which defines…

Logic in Computer Science · Computer Science 2016-10-05 Alasdair Armstrong , Brijesh Dongol , Simon Doherty

Many online transaction scheduler architectures and algorithms for various software transactional memories have been designed in order to maintain good system performance even for high concurrency workloads. Most of these algorithms were…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-16 Miroslav Popovic , Marko Popovic , Branislav Kordic , Huibiao Zhu

Transactional memory (TM) has emerged as a promising abstraction for concurrent programming alternative to lock-based synchronizations. However, most TM models admit only isolated transactions, which are not adequate in multi-threaded…

Programming Languages · Computer Science 2016-02-18 Marino Miculan , Marco Peressotti

The Trusted Platform Module (TPM) is a cryptoprocessor designed to protect integrity and security of modern computers. Communications with the TPM go through the TPM Software Stack (TSS), a popular implementation of which is the open-source…

Software Engineering · Computer Science 2023-10-30 Yani Ziani , Nikolai Kosmatov , Frédéric Loulergue , Daniel Gracia Pérez , Téo Bernier

This paper proposes an efficient framework to execute Smart Contract Transactions (SCTs) concurrently based on object semantics, using optimistic Single-Version Object-based Software Transactional Memory Systems (SVOSTMs) and Multi-Version…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-24 Parwat Singh Anjana , Hagit Attiya , Sweta Kumari , Sathya Peri , Archit Somani

Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-26 Alex Shamis , Matthew Renzelmann , Stanko Novakovic , Georgios Chatzopoulos , Anders T. Gjerdrum , Dan Alistarh , Aleksandar Dragojevic , Dushyanth Narayanan , Miguel Castro

Transactional memory (TM) allows concurrent processes to organize sequences of operations on shared \emph{data items} into atomic transactions. A transaction may commit, in which case it appears to have executed sequentially or it may…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-16 Petr Kuznetsov , Srivatsan Ravi

Software transactional memory implementations which allow transactions to work on inconsistent states of shared data, risk to cause application visible errors such as memory access violations or endless loops. Hence, many implementations…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-09-23 Holger Machens

Vision Mambas (ViMs) achieve remarkable success with sub-quadratic complexity, but their efficiency remains constrained by quadratic token scaling with image resolution. While existing methods address token redundancy, they overlook ViMs'…

Computer Vision and Pattern Recognition · Computer Science 2025-09-30 Yan Wen , Peng Ye , Lin Zhang , Baopu Li , Jiakang Yuan , Yaoxin Yang , Tao Chen

Traditionally, blockchain systems involve sharing transaction information across all blockchain network participants. Clearly, this introduces barriers to the adoption of the technology by the enterprise world, where preserving the privacy…

Cryptography and Security · Computer Science 2020-10-19 Elli Androulaki , Angelo De Caro , Kaoutar Elkhiyaoui , Christian Gorenflo , Alessandro Sorniotti , Marko Vukolic

Transactional memory (TM) is an inherently optimistic abstraction: it allows concurrent processes to execute sequences of shared-data accesses (transactions) speculatively, with an option of aborting them in the future. Early TM designs…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-03-07 Petr Kuznetsov , Srivatsan Ravi

Parallel execution of smart contract transactions in large multicore architectures is critical for higher efficiency and improved throughput. The main bottleneck for maximizing the throughput of a node through parallel execution is…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-15 Parwat Singh Anjana , Matin Amini , Rohit Kapoor , Rahul Parmar , Raghavendra Ramesh , Srivatsan Ravi , Joshua Tobkin

A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such…

Databases · Computer Science 2012-01-04 Per-Åke Larson , Spyros Blanas , Cristian Diaconu , Craig Freedman , Jignesh M. Patel , Mike Zwilling

Shared virtual memory (SVM) is key in heterogeneous systems on chip (SoCs), which combine a general-purpose host processor with a many-core accelerator, both for programmability and to avoid data duplication. However, SVM can bring a…

Hardware Architecture · Computer Science 2018-08-30 Andreas Kurth , Pirmin Vogel , Andrea Marongiu , Luca Benini

Multiparty session types (MSTs) are a type-based approach to verifying communication protocols, represented as global types in the framework. We present a precise subtyping relation for asynchronous MSTs with communicating state machines…

Formal Languages and Automata Theory · Computer Science 2024-01-30 Elaine Li , Felix Stutz , Thomas Wies