A queuing model‐based approach for the analysis of transactional memory systems. (10th July 2012)

• Record Type: Journal Article
• Authors: Yu, Xiao; He, Zhengyu; Hong, Bo; Schulze, Bruno; Rebello, Vinod; Moreira, Jose
• Is Part Of: Concurrency and computation. Volume 25:Number 6(2013:Apr.)
• Page Start: 808
• Page End: 825
• Publication Date: 2012-07-10
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.2867
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe2867-abs-0001"> <title>SUMMARY</title> <p id="cpe2867-para-0001">In this paper, we develop an analytical model of the execution efficiency of transactional memory (TM) systems. This model employs queuing theory to analyze the impact of an essential set of TM design parameters including the conflict rate, number of conflict detection/resolution points, and implementation overhead. The model is validated via extensive experiments. To demonstrate the effectiveness of the model, we further study the performance impact of two factors. Our study shows that, for a given TM‐based program, the frequency of performing conflict detection can be carefully chosen to minimize the mean transaction completion time. Our study also demonstrated the importance of reducing implementation overhead. We expect our study to be useful for designing TM systems and applications. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p> </abstract>