DocumentCode
2217954
Title
On the (dis)similarity of transactional memory workloads
Author
Hughes, Clay ; Poe, James ; Qouneh, Amer ; Li, Tao
Author_Institution
Intell. Design of Efficient Archit. Lab. (IDEAL), Univ. of Florida, Gainesville, FL, USA
fYear
2009
fDate
4-6 Oct. 2009
Firstpage
108
Lastpage
117
Abstract
Programming to exploit the resources in a multicore system remains a major obstacle for both computer and software engineers. Transactional memory offers an attractive alternative to traditional concurrent programming but implementations emerged before the programming model, leaving a gap in the design process. In previous research, transactional microbenchmarks have been used to evaluate designs or lock-based multithreaded workloads have been manually converted into their transactional equivalents; others have even created dedicated transactional benchmarks. Yet, throughout all of the investigations, transactional memory researchers have not settled on a way to describe the runtime characteristics that these programs exhibit; nor has there been any attempt to unify the way transactional memory implementations are evaluated. In addition, the similarity (or redundancy) of these workloads is largely unknown. Evaluating transactional memory designs using workloads that exhibit similar characteristics will unnecessarily increase the number of simulations without contributing new insight. On the other hand, arbitrarily choosing a subset of transactional memory workloads for evaluation can miss important features and lead to biased or incorrect conclusions. In this work, we propose a set of architecture-independent transaction-oriented workload characteristics that can accurately capture the behavior of transactional code. We apply principle component analysis and clustering algorithms to analyze the proposed workload characteristics collected from a set of SPLASH-2, STAMP, and PARSEC transactional memory programs. Our results show that using transactional characteristics to cluster the chosen benchmarks can reduce the number of required simulations by almost half. We also show that the methods presented in this paper can be used to identify specific feature subsets. With the increasing number of TM workloads in the future, we believe that the proposed transactional memor- y workload characterization techniques will help TM architects select a small, diverse, set of TM workloads for their design evaluation.
Keywords
concurrency control; pattern clustering; principal component analysis; software performance evaluation; transaction processing; PARSEC program; SPLASH-2 program; STAMP program; architecture-independent transaction; clustering algorithms; concurrent programming; multicore system; principle component analysis; transactional memory workloads; transactional microbenchmarks; workload similarity; Algorithm design and analysis; Application software; Clustering algorithms; Computer architecture; Design engineering; Monitoring; Multicore processing; Performance analysis; Process design; Runtime; Transactional memory; performance analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Workload Characterization, 2009. IISWC 2009. IEEE International Symposium on
Conference_Location
Austin, TX
Print_ISBN
978-1-4244-5156-2
Electronic_ISBN
978-1-4244-5157-2
Type
conf
DOI
10.1109/IISWC.2009.5306790
Filename
5306790
Link To Document