并行性挖掘的图文法方法  

Graph Grammar Based Method for Parallel Exploitation

作　　者：邹阳[1,2] 吕建[1] 曾晓勤[2] 

机构地区：[1]南京大学计算机软件新技术国家重点实验室,江苏南京210093 [2]河海大学计算机与信息学院,江苏南京210098

出　　处：《小型微型计算机系统》2011年第2期271-278,共8页Journal of Chinese Computer Systems

基　　金："核高基"科技重大专项(2009ZX01043-001-06)资助;国家"九七三"重点基础研究发展规划项目(2009CB320702)资助;国家"八六三"高技术研究发展计划项目(2007AA01Z178)资助;河海大学中央高校基本科研业务费(2009B21914)资助;河海大学自然科学基金项目(2009421011)资助

摘　　要：并行性分析技术一般通过对程序的控制与数据流图或相关依赖图的分析来实现,因而需要从程序中抽取出相应依赖图的算法的支持.本文基于上下文相关图文法RGG形式框架,定义了一种任务级的并行编程图语言GPPL来直接描述顺序或并行程序的控制与数据流图,而且设计了相应的并行性分析算法以挖掘GPPL图程序的并行性特征.GPPL图语言可视为并行程序设计与程序代码生成之间的协同语言,从而使并行性挖掘避免了从程序中抽取出相应依赖图的过程.与已有的描述顺序或并行程序的图语言及其分析算法相比,GPPL图程序形式更为简洁和直观,易于设计,描述能力也更强;基于GPPL图的并行性分析算法的分析能力更强,而且具有可扩展性.Parallel exploitation techniques are frequently implemented by analyzing the control and data flow graphs or other dependency graphs of programs, thus requiring the support of such algorithms that can extract from programs their pertinent dependency graphs. Based on the context-sensitive graph grammar formalism RGG, this paper defines a task-level parallel programming graph language GPPL to directly describe the control and data flow graphs of serial or parallel programs, and then constructs an algorithm to detect parallelism of GPPL graph programs. The GPPL can be viewed as a coordination language between parallel program design and code generation, so as to eliminate from parallel exploitation the need of the process of extracting relevant dependency graphs from programs. In comparison with the existing graph languages for specifying serial or parallel programs and their algorithms for parallel analyzing, GPPL is more succinct and intuitive, easier to design and more expressive, and the algorithm equipped with it is more powerful and yet extensible.

关 键 词：并行性挖掘 上下文相关图文法 图语言 并行性分析算法 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]