Obtaining Progress Guarantee and GreaterConcurrency in Multi-Version Object Semantics

by   Chirag Juyal, et al.
Indian Institute of Technology Hyderabad
Michigan State University

Software Transactional Memory Systems (STMs) provides ease of multithreading to the programmer withoutworrying about concurrency issues such as deadlock, livelock, priority inversion, etc. Most of the STMs workson read-write operations known as RWSTMs. Some STMs work at high-level operations and ensure greaterconcurrency than RWSTMs. Such STMs are known as Object-Based STMs (OSTMs). The transactions of OSTMscan return commit or abort. Aborted OSTMs transactions retry. But in the current setting of OSTMs, transactionsmay starve. So, we proposed a Starvation-Free OSTM (SF-OSTM) which ensures starvation-freedom whilesatisfying the correctness criteria as opacity.Databases, RWSTMs and OSTMs say that maintaining multiple versions corresponding to each key reduces thenumber of aborts and improves the throughput. So, to achieve the greater concurrency, we proposed Starvation-Free Multi-Version OSTM (SF-MVOSTM) which ensures starvation-freedom while storing multiple versioncorresponding to each key and satisfies the correctness criteria as local opacity. To show the performance benefits,We implemented three variants of SF-MVOSTM and compare its performance with state-of-the-art STMs


page 1

page 2

page 3

page 4


An Efficient Approach to Achieve Compositionality using Optimized Multi-Version Object Based Transactional Systems

In the modern era of multi-core systems, the main aim is to utilize the ...

InvisibleWriteRule: the sufficient condition for safely omittable write operations in concurrency control

Concurrency Control (CC) is the heart of the correctness and is the curr...

An Innovative Approach for Achieving Composability in Concurrent Systems using Multi-Version Object Based STMs

In the modern era of multicore processors, utilizing multiple cores prop...

Distributed Transactions: Dissecting the Nightmare

Many distributed storage systems are transactional and a lot of work has...

Efficient Single Writer Concurrency

In this paper we consider single writer multiple reader concurrency - an...

VBR: Version Based Reclamation

Safe lock-free memory reclamation is a difficult problem. Existing solut...

Multi-version Indexing in Flash-based Key-Value Stores

Maintaining multiple versions of data is popular in key-value stores sin...

Please sign up or login with your details

Forgot password? Click here to reset