Scheduling strategies for multiple optical grid applications based on scheduling span and fairness

Optical grids can integrate geographically distributed resources more efficiently to support applications because of characteristics of optical networks. The essential aspect of optical grid applications is scheduling. By scheduling, multiple optical grid applications from different users can be executed on one optical grid. This means multiple users can use one optical grid simultaneously. In this paper, we propose three new algorithms for the scheduling of multiple optical grid applications onto one optical grid, and one algorithm among these three can make the scheduling order dynamic. In these algorithms, communication contention has been incorporated into scheduling, and arrival time of multiple optical grid applications is assumed to abide by Poisson distribution to simulate multiple users. Our objects of scheduling are not only to make scheduling span short, but also to achieve low unfairness. Impacts of different algorithms are comparatively investigated by simulations.
multiple DAGs optical grid task scheduling fairness
Chao Qin Wei Guo Weiqiang Sun Yaohui Jin Weisheng Hu
State Key Lab on Fiber-Optic Local Area Networks and Advanced Optical CommunicationSystems,Shanghai Jiao Tong University,Shanghai,China,200240,
国际会议
2008亚太光通信会议(Asia-Pacific Optical Communications 2008)
杭州
英文
2008-10-26(万方平台首次上网日期,不代表论文的发表时间)