Concurrency control for Transactional Memory (TM) is investigated as a means for improving resource usage by adjusting dynamically the number of concurrently executing transactions. The proposed control system takes as feedback the measured Transaction Commit Rate to adjust the concurrency. Through an extensive evaluation, a new Concurrency Control Algorithm (CCA), called P-only Concurrency Control (PoCC), is shown to perform better than our other four proposed CCAs for a synthetic benchmark, and the STAMP and Lee-TM benchmarks. © 2008 Springer-Verlag Berlin Heidelberg
Concurrency control mechanisms including the wait, time-stamp and rollback mechanisms have been brie...
Many activities are comprised of temporally dependent events that must be executed in a specific chr...
We present an analytical performance modeling approach for concurrency control al- gorithms in the c...
Transactional memory (TM) systems have gained considerable popularity in the last decade driven by t...
Transactional memory (TM) systems have gained considerable popularity in the last decade driven by t...
Optimistic concurrency control, or OCC, can achieve excellent performance on uncontended workloads f...
We present an analytical performance modeling approach for concurrency control algorithms in the con...
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by elimi...
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by elimi...
This document is presented in fulfilment of the degree of \emph{Habilitation \`{a} Diriger des Reche...
Transactional Memory (TM) aims to make shared memory parallel programming easier by abstracting away...
Practically any notebook or desktop computer today is equipped with dual-core chips and already quad...
Software Transactional Memory (STM) is recognized as an effective programming paradigm for concurren...
Abstract. In this document we present an overview of Transactional Memory models, as well as a compa...
Distributed storage systems run transactions across ma-chines to ensure serializability. Traditional...
Concurrency control mechanisms including the wait, time-stamp and rollback mechanisms have been brie...
Many activities are comprised of temporally dependent events that must be executed in a specific chr...
We present an analytical performance modeling approach for concurrency control al- gorithms in the c...
Transactional memory (TM) systems have gained considerable popularity in the last decade driven by t...
Transactional memory (TM) systems have gained considerable popularity in the last decade driven by t...
Optimistic concurrency control, or OCC, can achieve excellent performance on uncontended workloads f...
We present an analytical performance modeling approach for concurrency control algorithms in the con...
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by elimi...
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by elimi...
This document is presented in fulfilment of the degree of \emph{Habilitation \`{a} Diriger des Reche...
Transactional Memory (TM) aims to make shared memory parallel programming easier by abstracting away...
Practically any notebook or desktop computer today is equipped with dual-core chips and already quad...
Software Transactional Memory (STM) is recognized as an effective programming paradigm for concurren...
Abstract. In this document we present an overview of Transactional Memory models, as well as a compa...
Distributed storage systems run transactions across ma-chines to ensure serializability. Traditional...
Concurrency control mechanisms including the wait, time-stamp and rollback mechanisms have been brie...
Many activities are comprised of temporally dependent events that must be executed in a specific chr...
We present an analytical performance modeling approach for concurrency control al- gorithms in the c...