Efficient means of Achieving Composability using Transactional Memory

Peri, Sathya and Singh, Ajay and Somani, Archit (2017) Efficient means of Achieving Composability using Transactional Memory. arXiv. pp. 1-46.

Text (arXiv copy)
1709.00681.pdf - Accepted Version

Download (987kB) | Preview


A major focus of software transaction memory systems (STMs) has been to felicitate the multiprocessor programming and provide parallel programmers an abstraction for speedy and efficient development of parallel applications. To this end, different models for incorporating object/higher level semantics into STM have recently been proposed in transactional boosting, transactional data structure library, open nested transactions and abstract nested transactions. We build an alternative object model STM (OSTM) by adopting the transactional tree model of Weikum et al. originally given for databases and extend the current work by proposing comprehensive legality definitions and conflict notion which allows efficient composability of \otm{}. We first time show the proposed OSTM to be co-opacity. We build OSTM using chained hash table data structure. Lazyskip-list is used to implement chaining using lazy approach. We notice that major concurrency hotspot is the chaining data structure within the hash table. Lazyskip-list is time efficient compared to lists in terms of traversal overhead by average case O(log(n)). We optimise lookups as they are validated at the instant they execute and they have not validated again in commit phase. This allows lookup dominated transactions to be more efficient and at the same time co-opacity.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Item Type: Article
Uncontrolled Keywords: Distributed, Parallel, and Cluster Computing
Subjects: Computer science > Special computer methods
Divisions: Department of Computer Science & Engineering
Depositing User: Team Library
Date Deposited: 11 Sep 2017 04:35
Last Modified: 11 Sep 2017 04:35
URI: http://raiith.iith.ac.in/id/eprint/3531
Publisher URL: https://arxiv.org/abs/1709.00681
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 3531 Statistics for this ePrint Item