Abstract
The existing parallelizing compilers can parallelize most of the loops with uniform dependences, but they do not satisfactorily handle loops with non-uniform dependences. Most of the time, the compiler leaves such loops running sequentially. Unfortunately, loops with non-uniform dependences are not so uncommon in the real world. This paper presents the two parallel region partitioning method of nested loops with non-uniform dependences for maximizing parallelism. By parallelizing anti dependence region using variable re-naming, we will divide the iteration space into two parallel regions by a line in case that FDT (Flow Dependence Tail set) does not overlap FDH (Flow Dependence Head set). Comparison with some related works shows more parallelism than other existing methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
