2019/05/03 by Chirag Juyal, Sandeep S. Kulkarni, Juyal, Chirag +7
Computer Science · #Distributed #Distributed and Parallel Computing Systems #Distributed systems and fault tolerance #FOS: Computer and information sciences #Parallel #Parallel Computing and Optimization Techniques #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1905.01200
openalex publication_date 2019/05/03 · openalex created_date 2022/07/29 · openalex updated_date 2026/07/28
In the modern era of multi-core systems, the main aim is to utilize the cores\nproperly. This utilization can be done by concurrent programming. But\ndeveloping a flawless and well-organized concurrent program is difficult.\nSoftware Transactional Memory Systems (STMs) are a convenient programming\ninterface which assist the programmer to access the shared memory concurrently\nwithout worrying about consistency issues such as priority-inversion, deadlock,\nlivelock, etc. Another important feature that STMs facilitate is\ncompositionality of concurrent programs with great ease. It composes different\nconcurrent operations in a single atomic unit by encapsulating them in a\ntransaction. Many STMs available in the literature execute read/write primitive\noperations on memory buffers. We represent them as Read-Write STMs or RWSTMs.\nWhereas, there exist some STMs (transactional boosting and its variants) which\nwork on higher level operations such as insert, delete, lookup, etc. on a\nhash-table. We refer these STMs as Object Based STMs or OSTMs. The literature\nof databases and RWSTMs say that maintaining multiple versions ensures greater\nconcurrency. This motivates us to maintain multiple version at higher level\nwith object semantics and achieves greater concurrency. So, this paper\npro-poses the notion of Optimized Multi-version Object Based STMs or\nOPT-MVOSTMs which encapsulates the idea of multiple versions in OSTMs to\nharness the greater concurrency efficiently.\n