期刊文献+

On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies

On the Problem of optimizing Parallel Programs for Complex Memory Hierarchies
原文传递
导出
摘要 Based on a thorough study of the relationship between array element accesses and loop indices of the nested loop, a method is presented with which the staggering relation and the compacting relation between the threads of the nested loop (either with a single linear function or with multiple linear functions) can be determined at compile-time,and accordingly the nested loop (either perfectly nested one or imperfectly nested one)can be restructured to avoid the thrashing problem. Due to its simplicity, our method can be efficiently implemented in any parallel compiler, and the improvement of the performance is significant as shown by the experimental results. Based on a thorough study of the relationship between array element accesses and loop indices of the nested loop, a method is presented with which the staggering relation and the compacting relation between the threads of the nested loop (either with a single linear function or with multiple linear functions) can be determined at compile-time,and accordingly the nested loop (either perfectly nested one or imperfectly nested one)can be restructured to avoid the thrashing problem. Due to its simplicity, our method can be efficiently implemented in any parallel compiler, and the improvement of the performance is significant as shown by the experimental results.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 1994年第1期1-26,共26页 计算机科学技术学报(英文版)
关键词 OPTIMIZATION parallel program complex memory hierarchies SRIS RSRIS compacted RSRIS Optimization, parallel program, complex memory hierarchies, SRIS,RSRIS, compacted RSRIS
  • 相关文献

参考文献6

  • 1金国华,1992年
  • 2金国华,1991年
  • 3Fang J,1991年
  • 4金国华,1991年
  • 5Yang X,1990年
  • 6Fang Z,1990年

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部