| 摘要: |
| 本文通过引入流及流上的递归方程,增强了FP表达并行算法的能力,有效地克服了用FP描述循环数据依赖及状态记忆的困难,文中给出了并行算法的FP描述及其可脉动化的判定定理。同时说明,许多在图上研究的脉动方法可以方便地应用到用FP描述脉动化的研究中去。 |
| 关键词: |
| DOI： |
| 分类号: |
| 基金项目: |
|
| DESCRIPTION OF PARALLEL ALGORITHMS BY FP AND DECIDABILITY OF ITS SYSTOLIC IMPLEMENTATION |
|
Hu Zhenjiang,Sun Yongqiang
|
| Abstract: |
| This paper extends the expressive power of FP by introducing stream and recursive equations on stream for the description of parallel algorithms with cyclic data dependency and states. The decidability theorem of about whether the FP program has its systolic implementation is given. This research also shows that the systoliclizing method on graph can be easily used on FP description. |
| Key words: |
