Incremental parallelization using navigational programming: A case study

被引:0
|
作者
Pan, L [1 ]
Zhang, WH [1 ]
Asuncion, A [1 ]
Lai, MK [1 ]
Dillencourt, MB [1 ]
Bic, LF [1 ]
机构
[1] Univ Calif Irvine, Donald Bern Sch Informat & Comp Sci, Irvine, CA 92697 USA
关键词
programming methodologies; incremental parallelization; navigational programming (NavP); program transformation; matrix multiplication; Gentleman's Algorithm; Cannon's Algorithm;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We show how a series of transformations can be applied to incrementally parallelize sequential programs. Our Navigational Programming (NavP) methodology is based on the principle of self-migrating computations and is truly incremental, in that each step represents a functioning program and every intermediate program is an improvement over its predecessor. The transformations are mechanical and straightforward to apply. We illustrate our methodology in the context of matrix multiplication. Our final stage is similar to the classical Gentleman's Algorithm. The NavP methodology is conducive to new ways of thinking that lead to ease of programming and high performance.
引用
收藏
页码:611 / 620
页数:10
相关论文
共 50 条