Abstract
Since Intel has recently shifted Transactional Synchronization Extension (TSX) as its first mainstream Hardware Transactional Memory (HTM), HTM has greatly changed the parallel programming paradigm for transaction processing, As a result, a number of studies on HTM have been conducted actively. However, the existing studies consider only the prediction of a conflict between two transactions and provide a static HTM configuration for all workloads. To solve the problems, we propose an efficient hardware transactional memory scheme based on both abort prediction and adaptive retry policy for multi-core in-memory databases. First, the proposed scheme can predict not only conflicts between transactions running concurrently, but also the capacity and other aborts of transactions by collecting the information of previously executed transactions. Second, the proposed scheme can provide a near-optimal HTM configuration according to the characteristic of a given workload by using an adaptive retry policy based on machine learning algorithms. Finally, through our experimental performance analysis using STAMP, the proposed scheme shows about 30~40% better performance than the existing HTM-based schemes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.