

浏览全部资源
扫码关注微信
有关标量块中的指令调度的成果很多
但它们不能用于向量块
因为向量块中的许多依赖关系不同于标量块中的依赖关系。 本文对向量块中的依赖关系进行了详细分析
提出一个时间复杂度为O(n
2
)的向量指令调度算法
本算法已在银河机编译器中实现。 使用本调度器
可向量化循环的目标代码将重新排序从而充分利用流水线机的多功能部件流水线及链接特性开发并行性。
There are many achievements on code scheduling in scalar blocks[1
2
6
12]
but they cannot be used in vector blocks because many dependences in vector blocks are different from those in scalar blocks. In this paper
after these dependences are analyzed in detail
an algorithm with an O(n*n) worst-case runtime for code scheduling in vector blocks has been presented and implemented in YH (Galaxy) supercomputer system. By using our scheduler
the object codes of a vectorized loop in a pipeline computer can be reordered in such a sequence that can make great use of the multi-functional pipelines and the chaining to exploit parallelism.
0
Views
14
下载量
1
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621