This paper addresses the problem of automatic thread partitioning of sequential programs. We propose a new algorithm, which has the main features as follows: 1) non-loop regions of programs may be parallelized; 2) partitioning is performed in the way that data locality in the new threads is improved. The algorithm is preliminarily evaluated using one handcrafted example and a generator of data dependence graphs, tuned to generate random graphs with characteristics close to those of real-world programs, and a cache simulator. The results of evaluation are presented which shows feasibility of our approach. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Chernov, A., Belevantsev, A., & Malikov, O. (2004). A thread partitioning algorithm for data locality improvement. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 278–285. https://doi.org/10.1007/978-3-540-24669-5_36
Mendeley helps you to discover research relevant for your work.