Bibliographic Details
| Title: |
Online Algorithms for Scheduling Transactions on Python Software Transactional Memory. |
| Authors: |
Popović, Marko, Kordić, Branislav, Popović, Miroslav, Bašičević, Ilija |
| Source: |
Serbian Journal of Electrical Engineering; Feb2019, Vol. 16 Issue 1, p85-104, 20p |
| Subject Terms: |
COMPUTER scheduling, TRANSACTION systems (Computer systems), ONLINE algorithms, MEMORY |
| Abstract: |
Designing online transaction scheduling algorithms is challenging because one needs to reconcile three opposing requirements: (i) they should be fast, (ii) they should minimize makespan 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Serbian Journal of Electrical Engineering is the property of Serbian Journal of Electrical Engineering and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Nájsť tento článok vo Web of Science