%0 Journal Article
%T Parallelizing Programs with Sequential Scanning<br>顺序扫描实现程序并行化
%A RONG Hong-bo
%A TANG Zhi-zhong
%A <br>容红波
%A 汤志忠
%J 软件学报
%D 2000
%I 
%X Generalized selective scheduling (GSS) is presented to uniformly process loops and acyclic code. GSS does not differentiate acyclic code from cyclic code, but generates the result of global compaction and software pipelining for them respectively. The program is parallelized not by hierarchical simplification, but by only one-pass sequential scanning. As the first global scheduling based on general graphs instead of traces or directed acyclic graphs, GSS breaks the boundary between acyclic and cyclic code scheduling. It views nested loops from a fresh angle, realizing the direct scheduling of nests by properly calculating availability sets and live variable sets. It is applicable to programs with arbitrary control flow.
%K instruction-level parallelism
%K global compaction
%K software pipelining
%K branch
%K nested loop<br>指令级并行
%K 全局压缩
%K 软件流水
%K 分支
%K 多重循环
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=0A1E04A9E287C8B1&yid=9806D0D4EAA9BED3&vid=708DD6B15D2464E8&iid=59906B3B2830C2C5&sid=F8C186D6055F60DE&eid=03F4C4D3CD1EB259&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=5