###
DOI:
Journal of Software:2001.12(4):544-555

基于路径分组与数据相关松弛的软件流水
容红波,汤志忠
(清华大学计算机科学与技术系,北京 100084)
Software Pipelining Based on Path Grouping and Data Dependence Relaxation
RONG Hong-bo,TANG Zhi-zhong
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2378   Download 2674
Received:November 15, 1999    Revised:January 25, 2000
> 中文摘要: 软件流水是循环调度的重要方法.有分支循环的流水依然是个难题.现有算法可以分为4类:循环线性化、路径分离、整体调度和路径选择.它们都未能和谐地解决两个对立问题:转移时间最小化和最差约束问题.提出了基于路径分组和数据相关松弛的软件流水框架,试图无矛盾地解决上述问题.其主要思想是:(1)路径分组,即按照路径的执行概率和转移概率将路径分组,力求最小化转移时间;(2)数据相关松弛,力求避免最差约束,即当循环有多条路径时,有些相关在循环执行中并不一定有实例,理想的策略是仅当它有实例时才遵守.初步实验和定性分析表明,此
中文关键词: 指令级并行  软件流水  路径  概率  数据相关
Abstract:Software pipelining is an effective approach of loop scheduling. Pipelining of loops with conditional branches remains a challenge. Current algorithms are divided into four classes: loop linearizaton, path splitting, as-a-whole scheduling and path selecting. All of them fail to solve concurrently two conflicting problems: transfer time minimization and worst-case constraints. In this paper, a novel software pipelining framework is presented to do so. The key ideas are: (1) Path grouping, which splits paths into distinct groups based on their execution and transfer probability, so as to minimize transfer time; (2) Data dependence relaxation. Some data dependences may not have instances during execution when the loop has multiple paths. The ideal policy is to obey them only when they have instances. Thus the worst-case constraints are avoided. Preliminary experiments and qualitative analysis all suggest that the temporal benefit of the proposed approach is better than that of path splitting and as-a-whole scheduling.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金资助项目(69773028) 国家自然科学基金资助项目(69773028)
Foundation items:
Reference text:

容红波,汤志忠.基于路径分组与数据相关松弛的软件流水.软件学报,2001,12(4):544-555

RONG Hong-bo,TANG Zhi-zhong.Software Pipelining Based on Path Grouping and Data Dependence Relaxation.Journal of Software,2001,12(4):544-555