DocumentCode
144766
Title
Increase the concurrency for multi-core systems through collision array based workload assignment
Author
He Zhou ; Powers, Linda S. ; Roveda, Janet
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA
Volume
2
fYear
2014
fDate
26-28 April 2014
Firstpage
1209
Lastpage
1215
Abstract
Simply upgrading to multi-core systems has been proven to provide only minor speedup compared with single core systems. However, because multi-core systems use shared memory, the bottleneck for speedup lies in the memory I/O. The only way to fully utilize multiple cores is to increase parallelism and concurrency. This paper proposes a new collision array based workload assignment to increase data request cancellation. Through a task flow partitioning algorithm, we minimize sequential data access and then dynamically schedule tasks while increasing the data request cancellations. We have shown experimentally that this method can boost general system throughput by 3 times and reduce the execution time by an average of 27.6%. For a 3×3 multi-core system, if all nine cores are utilized, the speedup can reach 5.0 times. If only three cores are utilized to reduce communication and power, the proposed method can obtain 2.3 times speedup.
Keywords
data structures; information retrieval; shared memory systems; collision array; data request cancellation; execution time; memory I-O; multicore systems; sequential data access; shared memory; single core systems; task flow partitioning algorithm; workload assignment; Arrays; Dynamic scheduling; Multicore processing; Parallel processing; Partitioning algorithms; Throughput; collision array; concurrent; multi-core system; workload assignment;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science, Electronics and Electrical Engineering (ISEEE), 2014 International Conference on
Conference_Location
Sapporo
Print_ISBN
978-1-4799-3196-5
Type
conf
DOI
10.1109/InfoSEEE.2014.6947862
Filename
6947862
Link To Document