DocumentCode
465286
Title
A Memory-Conscious Code Parallelization Scheme
Author
Xue, Liping ; Ozturk, Ozcan ; Kandemir, Mahmut
Author_Institution
Univ. of Delaware, Newark
fYear
2007
fDate
4-8 June 2007
Firstpage
230
Lastpage
233
Abstract
While there have been considerable work in the last couple of years for architecting embedded chip multiprocessors, programming and compiler support required for them took relatively less attention. Our goal in this paper is to show that conventional compiler-directed code parallelization used in high performance computing is not very suitable for embedded chip multiprocessors where minimizing memory space requirements is an important issue. We propose and evaluate a novel memory-conscious loop parallelization strategy with the objective of minimizing the data memory requirements of processors. The proposed approach, which is formulated as a branch-and-bound problem, accomplishes its objective by being careful in selecting the loops to parallelize in a given loop nest. Miscellaneous. Experimentation, Algorithms, Performance.
Keywords
integrated memory circuits; multiprocessing systems; parallel processing; tree searching; branch-and-bound problem; compiler-directed code parallelization; data memory requirements; embedded chip multiprocessors; memory-conscious code parallelization scheme; Engineering profession; High performance computing; Optimization methods; Parallel programming; Partitioning algorithms; Program processors; Algorithms; Code Parallelization; Embedded CMP; Experimentation; Memory Space Optimization; Performance;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2007. DAC '07. 44th ACM/IEEE
Conference_Location
San Diego, CA
ISSN
0738-100X
Print_ISBN
978-1-59593-627-1
Type
conf
Filename
4261177
Link To Document