所属专题: Computer Architecture and Systems

• Articles •    下一篇

On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies

金国华; 陈福接   

  1. Department of Computer Science; Changsha Institute of Technology; Changsha 410073
  • 出版日期:1994-01-10 发布日期:1994-01-10

On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies

Jin Guohua; Chen Fujie;   

  1. Department of Computer Science; Changsha Institute of Technology; Changsha 410073
  • Online:1994-01-10 Published:1994-01-10

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 m…

关键词: CMOS complex cell, stuck-open faults, testing, TPG, BIST

Abstract: 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 m…

Key words: BIST, CMOS complex cell, stuck-open faults, testing, TPG



[1] Abu-Sufah W, Kuck D J, Lawrie D H. On the performance enhancement of paging systemsthrough program analysis and transformation .IEEE Trans on Computers, 1981, C-30(5) :341-355 . …
[1] . 一款高性能通用处理器可测试性设计特色与测试执行[J]. , 2008, 23(6 ): 1037-1046 .
[2] . 利用测试中的相关性实现低成本扫描测试[J]. , 2007, 22(5): 681-694 .
[3] . 改进修改后代码中的故障检测——来自电信业的研究[J]. , 2007, 22(3): 397-409 .
[4] . 混合BIST核系统的测试时间最小化[J]. , 2006, 21(6): 907-912 .
[5] . 面向对象的系统的基于代码的分析[J]. , 2006, 21(6): 965-972 .
[6] . 软件可靠性实验与控制[J]. , 2006, 21(5): 697-707 .
[7] . 基于 FPGA的查找表的一种测试方法[J]. , 2006, 21(1): 141-146 .
[8] . 计算复杂性理论的进展[J]. , 2005, 20(6): 735-750 .
[9] . [J]. , 2005, 20(2): 175-186.
[10] . [J]. , 2005, 20(2): 201-209.
[11] . [J]. , 2005, 20(2): 216-223.
[12] . [J]. , 2005, 20(2): 0-0.
[13] . [J]. , 2003, 18(3): 0-0.
[14] . [J]. , 2003, 18(3): 0-0.
[15] . [J]. , 2003, 18(2): 0-0.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] 陈国良;. A Partitioning Selection Algorithm on Multiprocessors[J]. , 1988, 3(4): 241 -250 .
[2] 周国栋; 叶甘霖;. Forward-Backward Search Method[J]. , 1988, 3(4): 289 -305 .
[3] 周哈阳;. Analogical Learning and Automated Rule Constructions[J]. , 1991, 6(4): 316 -328 .
[4] 马军; 马绍汉;. Efficient Parallel Algorithms for Some Graph Theory Problems[J]. , 1993, 8(4): 76 -80 .
[5] 周建强; 谢立; 戴非; 孙钟秀;. Adaptive Memory Coherence Algorithms in DSVM[J]. , 1994, 9(4): 365 -372 .
[6] 张松懋;. Weak Precedence Story Parsing Grammar[J]. , 1995, 10(1): 53 -64 .
[7] Kian-Lee Tan;. Optimization of Multi-Join Queries in Shared-Nothing Systems[J]. , 1995, 10(2): 149 -162 .
[8] 许满武; 陆剑锋; 曾凡聪; 戴劲雯;. A Formal Semantics for DAI Language NUML[J]. , 1995, 10(3): 227 -238 .
[9] 管伟光; 解林; 马颂德;. Deformable Registration of Digital Images[J]. , 1998, 13(3): 246 -260 .
[10] 聂旭民; 郭青;. Renaming a Set of Non-Horn Clauses[J]. , 2000, 15(5): 409 -415 .
版权所有 © 《计算机科学技术学报》编辑部
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持:support@magtech.com.cn
总访问量: