DocumentCode :
2937120
Title :
A Method of Computation Decomposition on Tightly-Nested Loop Automatic Parallelization
Author :
Yan, Zhao ; Liu, Lei
Author_Institution :
Coll. of Comput. Sci. & Technol., JiLin Univ., Changchun, China
Volume :
3
fYear :
2009
fDate :
21-22 Nov. 2009
Firstpage :
431
Lastpage :
434
Abstract :
An automatic parallelization method for tightly-nested loops running on multi-core system has been proposed. First, according to the physical characteristics of multi-core processors, a way has been presented to solve the problem on dada locality during data decomposition; Second, for increasing parallel granularity of tight nested loops, the method discussed in this article studied computation decomposition based on workload, and brought forward how to compute the workload of loop iteration that can be run in parallel, and at last according to the size of the workload, determined the granularity of parallel loops to achieve to reduce the parallel overhead brought by the parallel iteration of small workload. Using this method, an automatic parallelization model based on workload can be constructed.
Keywords :
multiprocessing systems; parallel processing; computation decomposition; data decomposition; multicore processors; multicore system; tightly-nested loop automatic parallelization model; Application software; Computer science; Concurrent computing; Costs; Educational institutions; Multicore processing; Multiprocessing systems; Parallel processing; Physics computing; Programming profession; data decomposition; data locality; decomposition; loop parallelization; workload;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Information Technology Application, 2009. IITA 2009. Third International Symposium on
Conference_Location :
Nanchang
Print_ISBN :
978-0-7695-3859-4
Type :
conf
DOI :
10.1109/IITA.2009.405
Filename :
5370570
Link To Document :
بازگشت