The Cost of Privatization in Software Transactional Memory

2013 ◽  
Vol 62 (12) ◽  
pp. 2531-2543 ◽  
Author(s):  
Hagit Attiya ◽  
Eshcar Hillel
Keyword(s):  
Transactional Memory ◽  
Software Transactional Memory ◽  
The Cost

scholarly journals Online algorithms for scheduling transactions on python software transactional memory

2019 ◽  
Vol 16 (1) ◽  
pp. 85-104 ◽  
Author(s):  
Marko Popovic ◽  
Branislav Kordic ◽  
Miroslav Popovic ◽  
Ilija Basicevic
Keyword(s):  
Theoretical Analysis ◽  
Online Algorithms ◽  
Time Complexity ◽  
Transactional Memory ◽  
Scheduling Algorithms ◽  
Software Transactional Memory ◽  
Transaction Scheduling ◽  
The Cost ◽  
Time Bounds

Designing online transaction scheduling algorithms is challenging because one needs to reconcile three opposing requirements: (i) they should be fast, (ii) they should minimize make span and maximize throughput, and (iii) they should produce conflict-free transaction schedules. In this paper we present four online transaction scheduling algorithms, namely, RR, ETLB, AC, and AAC algorithm, we prove their correctness and time bounds, and we conduct a theoretical analysis of the transaction schedules they produce, using three different workloads (RDW, CFW, and WDW). Finally, we compare various features of the four algorithms. The results are as expected, as we go from RR, over ETLB and AC, to AAC algorithms, the quality of the resulting schedules increases at the cost of increase of algorithm?s time complexity.

scholarly journals Revisiting software transactional memory in Haskell

2018 ◽  
Vol 51 (12) ◽  
pp. 105-113
Author(s):  
Matthew Le ◽  
Ryan Yates ◽  
Matthew Fluet
Keyword(s):  
Transactional Memory ◽  
Software Transactional Memory
Sign in / Sign up

Export Citation Format

Share Document