Dynamic multi DAG scheduling algorithm for optical grid environment

Facing the evolvement of the Optical Grid technology, dynamic task scheduling can largely improve the efficiency of the Grid environment under the real circumstances. We propose a Serve On Time (SOT) algorithm - based on the idea of combining all the dynamic multi tasks so that all the tasks will obtain the rights to be served as soon as possible. We then introduce the basic First Come First Serve (FCFS) algorithm. A simulation will show the advantage of SOT.

[1]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[2]  Frode Eika Sandnes,et al.  Toward a realistic task scheduling model , 2006, IEEE Transactions on Parallel and Distributed Systems.

[3]  Arjan J. C. van Gemund,et al.  Low-Cost Task Scheduling for Distributed-Memory Machines , 2002, IEEE Trans. Parallel Distributed Syst..

[4]  P. Sadayappan,et al.  Job fairness in non-preemptive job scheduling , 2004 .

[5]  P. Sadayappan,et al.  Job fairness in non-preemptive job scheduling , 2004, International Conference on Parallel Processing, 2004. ICPP 2004..

[6]  Füsun Özgüner,et al.  Dynamic, competitive scheduling of multiple DAGs in a distributed heterogeneous environment , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[7]  Mourad Hakem,et al.  Dynamic critical path scheduling parallel programs onto multiprocessors , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[8]  Wei Guo,et al.  Task scheduling algorithm for optical grid architecture , 2006, SPIE/OSA/IEEE Asia Communications and Photonics.

[9]  Chen Xiang.  Department of Computer Science and Technology , 2006 .