%0 Journal Article
%T Flexible Data Dependence and Software Pipelining<br>弹性数据相关与软件流水
%A RONG Hong bo
%A TANG Zhi zhong
%A <br>容红波
%A 汤志忠
%J 软件学报
%D 2001
%I 
%X For software pipeling of loops with conditional statements, the worst-case path is a great abstacle. In such a loop, some data dependencies called flexible dependencies, may or may not have instances during execution of the loop. From this fact, flexible dependencies that severely limit parallelization of the loop are identified and replaced with less tight virtual dependencies. Then software pipelining is applied. If the schedule does not satisfy the original flexible dependencies, downpush transform is used to rectify. The resulting schedule is partly or completely free of the worst-case effects. This approac is a complement to the classical control speculation. It is characterized by a try-and-catch way: errors are first allowed to be present in the schedule, and then rectified.
%K instruction level parallelism
%K instruction scheduling
%K software pipelining
%K data dependence
%K loop<br>指令级并行
%K 指令调度
%K 软件流水
%K 数据相关
%K 循环
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=0F8FD04BFB4CDEAC&yid=14E7EF987E4155E6&vid=59906B3B2830C2C5&iid=B31275AF3241DB2D&sid=117143DBED3B4430&eid=0FCE62EC9DC00F5E&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=18