[1] [1] FOSTER I, GROSSMAN R L. Data integration in a bandwidth-rich world［J］. Communications of the ACM, 2003, 46(11): 50-57.

[2] [2] GUO Wei, SUN Wei-qiang, JIN Yao-hui, et al. Demonstration of joint resource scheduling in an optical network integrated computing environment［J］. Communications Magazine, 2010, 48(5): 76-83.

[3] [3] HE Jian-wu, MEI Jie, GU Wan-yi, et al. A novel distributed restoration method in intelligent otical networks［J］. Acta Photonica Sinica, 2003, 32(12): 1464-1469.

[4] [4] VEERARAGHAVAN M, ZHENG X, HUANG Z. On the use of connection-oriented networks to support grid computing［J］. Communications Magazine, 2006, 44(3): 118-123.

[5] [5] GUO Yan-tao, LIU Zeng-ji. QoS policies for core nodes in optical burst switching networks［J］. Acta Photonica Sinica, 2005, 34(11): 1706-1709.

[6] [6] WU M Y, SHU W, GU J. Local search for DAG scheduling and task assignment［C］. IEEE Proceedings of the 1997 International Conference on Parallel Processing, 1997, 174-180.

[7] [7] SINNEN O, SOUSA L. Communication contention in task scheduling［J］. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(6): 503-515.

[8] [8] WANG Yan, JIN Yao-hui, GUO Wei, et al. Joint scheduling for optical grid applications［J］.Journal of Optical Networking ,2007, 6(3): 304-318.

[9] [9] GUO Wei, WANG Zheng-yu, SUN Zhen-yi, et al. Task scheduling accuracy analysis in optical grid environments［J］. Photonic Network Communications, 2009, 17(3): 209-217.

[10] [10] SUN Zhen-yu, GUO Wei, WANG Zheng-yu, et al. Scheduling algorithm for workflow-based applications in optical grid［J］. Journal of Lightwave Technology, 2008, 26(17): 3011-3020.

[11] [11] KIM S, LEE S, HAHM J. Push-pull: Deterministic search-based dag scheduling for heterogeneous cluster systems［J］. IEEE Transactions on Parallel and Distributed Systems, 2007, 18(11): 1489-1502.

[12] [12] BOYER W, HURA G. Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments［J］. Journal of Parallel and Distributed Computing, 2005, 65(9): 1035-1046.

[13] [13] FOULDS L, GRAHAM R.The steiner problem in phylogeny is NP-complete［J］. Advances in Applied Mathematic,1982, 3(2): 43-49.

[14] [14] SINNEN O, SOUSA L. List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures［J］. Parallel Computing, 2004, 30(1): 81-101.

[15] [15] LIU G Q, POH K L, XIE M. Iterative list scheduling for heterogeneous computing［J］. Journal of Parallel and Distributed Computing, 2005, 65(5): 654-665.