A Low Network Competition Scheduling Algorithm for EDGE Architecture
A new way of scheduling which is different from traditional architecture has been adopted by EDGE architecture-Static Placement Dynamic Issue.The placement is based on the net-work hops, rather than real-time delay.Besides, more parallelisms produce more network resource competition, which make the real-time delay greatly exceed the hops of communication.In order to alleviate the problem of network resource bottleneck, we present a simple map algorithm for transforming the remote communications to local bypass, called Deep.The algorithm reduced by about 50% remote communications whose latency is high and got the performance improvement of 5.76% in float SPEC program when the width of local bypass is four.Then, we present the Opt-Deep algorithm which optimized the Deep algorithm according to the micro-structure.The performance of Opt-Deep increased by 7.26% in float SPEC program under above conditions.These results suggest that the new algorithms can effectively solve the problem of global network resources competition at the cost of extra execution resources.
EDGE architecture scheduling technology network resource competition
Zhang Chao Yang Bing Yu Mingyan
Harbin Institute of Technology, Harbin 150001, China
国内会议
西宁
英文
236-241
2013-07-20（万方平台首次上网日期，不代表论文的发表时间）