Tiling with limited resources

被引:7
作者
Calland, PY
Dongarra, J
Robert, Y
机构
来源
IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS, PROCEEDINGS | 1997年
关键词
tiling; communication-computation overlap; mapping; limited resources;
D O I
10.1109/ASAP.1997.606829
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. Little work has been devoted to the mapping and scheduling of the tiles on to physical processors. We present several new results in the contest of limited computational resources, and assuming communication-computation overlap. In particular under some reasonable assumptions, we derive the optimal mapping and scheduling of tiles to physical processors.
引用
收藏
页码:229 / 238
页数:10
相关论文
empty
未找到相关数据