Abstract
Automatic parallelization of loop programs based on space-time mapping typically aims at maximal parallelism. In order to obtain reasonable performance, the granularity of the parallelism must be coarsened, e.g., by applying tiling techniques.In contrast to others, we suggest to apply tiling after the computation of a space-time mapping. This extends the applicability of existing tiling methods and significantly improves efficiency of parallelized loop programs.
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.
