Paper Info
Title
Accelerating sequential programs on commodity multi-core processors
Abstract
A recently proposed pipelined multithreading (PMT) technique exhibits wide applicability in parallelizing general sequential programs on multi-core processors. However, significant inter-core communication overhead limits PMT performance and prevents its commercial utilization. A simple and effective clustered pipelined multithreading (CPMT) approach is presented to accelerate sequential programs on commodity multi-core processors. This CPMT technique adopts a clustered communication mechanism that can yield very low average communication overhead by eliminating false sharing as well as reducing communication operation and transit delays in the software-only approach. A single-producer/single-consumer concurrent lock-free clusteredQueue algorithm based on a two-level queue structure is also proposed. The accuracy of CPMT is theoretically demonstrated. The performances of the algorithm and CPMT are evaluated on a commodity AMD Phenom four-core processor. The number of enqueue and dequeue times of the algorithm are 20.8 and 23 cycles given an appropriate parameter, respectively. The speedup of CPMT ranges from 13.1% to 119.8% for typical loops extracted from the SPEC CPU 2000 benchmark suite.
Year
DOI
Venue
2014
10.1016/j.jpdc.2013.12.009
J. Parallel Distrib. Comput.
Keywords
Field
DocType
significant inter-core communication overhead,commodity amd phenom four-core,pmt performance,sequential program,low average communication overhead,communication operation,cpmt technique,cpmt range,commodity multi-core processor,communication mechanism,pipelined multithreading
Multithreading,Suite,Computer science,Queue,Parallel computing,False sharing,Spec#,Multi-core processor,Double-ended queue,Speedup,Distributed computing
Journal
Volume
Issue
ISSN
74
4
0743-7315
Citations 
PageRank 
References 
2
0.37
23
Authors
3
Name
Order
Citations
PageRank
Yuanming Zhang1102.86
Gang Xiao26813.96
Takanobu Baba37127.53