Abstract
In this work we propose a run-time approach for the efficient parallel execution of do across loops with indirect array accesses by means of a graph partitioning strategy. Our approach focuses not only on extracting parallelism among iterations of the loop, but also on exploiting data access locality to improve memory hierarchy behavior and thus the overall program speedup. The effectiveness of our algorithm is assessed in an SGI Origin 2000.
Cite
CITATION STYLE
Martín, M. J., Singh, D. E., Touriño, J., & Rivera, F. F. (2002). Improving locality in the parallelization of doacross loops. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2400, pp. 275–279). Springer Verlag. https://doi.org/10.1007/3-540-45706-2_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
