Bibliographic Details
| Title: |
Restart Optimization for Transactional Memory with Lazy Conflict Detection. |
| Authors: |
Cvetanović, Miloš, Radivojević, Zaharije, Milutinović, Veljko |
| Source: |
International Journal of Parallel Programming; Jun2017, Vol. 45 Issue 3, p482-507, 26p |
| Subject Terms: |
CACHE memory, MATHEMATICAL optimization, CONTINUOUS time models, PERFORMANCE evaluation, SIMULATION methods & models, PROBABILITY theory |
| Abstract: |
This paper presents an optimization algorithm for transactional memory with lazy conflict detection. The proposed optimization attempts to minimize the execution time of restarted transactions. Minimizing happens during restart, by avoiding the re-execution of a section of a transaction that is unaffected by the restart. The proposed optimization builds on previous research and differs in that it eliminates the need for the prediction of conflicting accesses and introduces incremental context saving. Moreover, the paper introduces analytical models for estimating the execution time of transactions, with and without the restart optimization, that are developed using the continuous-time model. A critical evaluation comparing analytical models with the simulation results is discussed in the paper. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Parallel Programming is the property of Springer Nature 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 |
Full Text Finder 
Nájsť tento článok vo Web of Science