A MECHANISM FOR KEEPING USEFUL INTERNAL INFORMATION IN PARALLEL PROGRAMMING TOOLS - THE DATA ACCESS DESCRIPTOR

被引:19
作者
BALASUNDARAM, V
机构
[1] Caltech Concurrent Computation Program, Mail Code 206-49, Caltech, Pasadena
基金
美国国家科学基金会;
关键词
D O I
10.1016/0743-7315(90)90043-O
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An important aspect of any parallel programming tool is its ability to provide useful information that can help the user optimize a program for efficient parallel execution or debug a parallel program. In many parallel programming tools, data dependence information is a fundamental requirement for the implementation of the various utilities provided by the tool. Experience has shown that while data dependence is a powerful concept, it sometimes causes several complexities both in internal analysis and in programmer-tool interaction. These problems can be overcome by summarizing the effect of data dependences in parts of the program. This paper presents a mechanism for summarizing data accesses in numerical scientific programs that is easy to implement and manipulate in a programming tool. Data dependence is viewed as an intersection between data access summaries, which allows data dependence and data access to be treated in a unified manner. © 1990.
引用
收藏
页码:154 / 170
页数:17
相关论文
共 29 条
  • [1] ALLEN F, 1987, P INT C SUPERCOMPUTI
  • [2] ALLEN JR, 1982, MASCTR826 RIC U DEP
  • [3] BALASUNDARAM V, 1989, SUPERCOMPUTING 8 NOV
  • [4] BALASUNDARAM V, 1989, JUN P INT C SUP CRET
  • [5] BALASUNDARAM V, COMP TR8995 DEP COMP
  • [6] BALASUNDARAM V, 1988, TR8871 RIC U DEP COM
  • [7] BALASUNDARAM V, 1989, JUN P ACM SIGPLAN 89
  • [8] BANERJEE U, 79989 DEP COMP SCI T
  • [9] Banerjee U., 1988, DEPENDENCE ANAL SUPE
  • [10] BREWER O, 1988, 120 ARG NAT LAB TECH