Improving parallelism of nested loops with non-uniform dependences

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper defines the properties of FDT (Flow Dependence Tail set) and FDH (Flow Dependence Head set), and presents two partitioning methods for finding two parallel regions in two-dimensional solution space. One is the region partitioning method by intersection of FDT and FDH. Another is the region partitioning method by two given equations. Both methods show how to determine whether the intersection of FDT and FDH is empty or not. In the case that FDT does not overlap FDH, we will divide the iteration space into two parallel regions by a line. The iterations within each area can be fully executed in parallel. So, we can find two parallel regions for doubly nested loops with non-uniform dependences for maximizing parallelism. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Jeong, S. J., & Han, K. H. (2005). Improving parallelism of nested loops with non-uniform dependences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3779 LNCS, pp. 205–212). Springer Verlag. https://doi.org/10.1007/11577188_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free