Share Email Print
cover

Proceedings Paper

Task scheduling algorithm for optical grid architecture
Author(s): Wei Guo; Zhenyu Sun; Zhengyu Wang; Pengshan Zhang; Jing Ma; Yan Wang; Yaohui Jin; Weiqiang Sun; Weisheng Hu
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 Grid that provides a way to integrate the geographical distributed resources for large-scale grid applications. This paper mainly focuses on the task scheduling issue in Optical Grid and proposes two task scheduling algorithms to minimize the total time or scheduling length required for a given task. A simulated optical grid has been addressed to demonstrate the effectiveness of the scheduling approach. The performance tests and analysis of the two algorithms are investigated to show the effect of the routing policy on the scheduling length. A more flexible policy is able to further improve scheduling length.

Paper Details

Date Published: 28 September 2006
PDF: 9 pages
Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 63540P (28 September 2006); doi: 10.1117/12.691670
Show Author Affiliations
Wei Guo, Shanghai Jiao Tong Univ. (China)
Zhenyu Sun, Shanghai Jiao Tong Univ. (China)
Zhengyu Wang, Shanghai Jiao Tong Univ. (China)
Pengshan Zhang, Shanghai Jiao Tong Univ. (China)
Jing Ma, Shanghai Jiao Tong Univ. (China)
Yan Wang, Shanghai Jiao Tong Univ. (China)
Yaohui Jin, Shanghai Jiao Tong Univ. (China)
Weiqiang Sun, Shanghai Jiao Tong Univ. (China)
Weisheng Hu, Shanghai Jiao Tong Univ. (China)


Published in SPIE Proceedings Vol. 6354:
Network Architectures, Management, and Applications IV
Yong Hyub Won; Gee-Kung Chang; Ken-ichi Sato; Jian Wu, Editor(s)

© SPIE. Terms of Use
Back to Top