TEA-SEA: Tiling and scheduling of non-uniform two-level perfectly nested loops using an evolutionary approach
作者：
Highlights：
• Tiling of the non-uniform loops without uniformization aiming to execute in parallel.
• Designing the dependency counting algorithm to identify communications between tiles.
• Forming a task graph from tiles and using a method for scheduling.
摘要
•Tiling of the non-uniform loops without uniformization aiming to execute in parallel.•Designing the dependency counting algorithm to identify communications between tiles.•Forming a task graph from tiles and using a method for scheduling.
论文关键词：Parallelization,Non-uniform two-level loops,Tiling task graph,Scheduling,Evolutionary approach
论文评审过程：Received 8 February 2020, Revised 19 September 2021, Accepted 23 October 2021, Available online 23 November 2021, Version of Record 12 January 2022.
论文官网地址：https://doi.org/10.1016/j.eswa.2021.116152
