Share Email Print

Proceedings Paper

Scheduling strategies for multiple optical grid applications based on scheduling span and fairness
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 19 November 2008
PDF: 12 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 713715 (19 November 2008); doi: 10.1117/12.803530
Show Author Affiliations
Chao Qin, Shanghai Jiaotong Univ. (China)
Wei Guo, Shanghai Jiaotong Univ. (China)
Weiqiang Sun, Shanghai Jiaotong Univ. (China)
Yaohui Jin, Shanghai Jiaotong Univ. (China)
Weisheng Hu, Shanghai Jiaotong Univ. (China)

Published in SPIE Proceedings Vol. 7137:
Network Architectures, Management, and Applications VI
Weisheng Hu; Shoa-Kai Liu; Ken-ichi Sato; Lena Wosinska, Editor(s)

© SPIE. Terms of Use
Back to Top