Dynamic multi DAG scheduling algorithm for optical grid environment
Lìyǐng Zhū, Zhenyu Sun, Wei Guo et al. · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2007
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.
Cited by 17 works. doi:10.1117/12.745354
Authors
References
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
- Dynamic, competitive scheduling of multiple DAGs in a distributed heterogeneous environment
- Low-cost task scheduling for distributed-memory machines
- Toward a realistic task scheduling model
- Job fairness in non-preemptive job scheduling
- Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors