A new DAG based Dynamic Task Scheduling Algorithm (DYTAS) for Multiprocessor Systems
D. I. George Amalarethinam, G J Joyce Mary · International Journal of Computer Applications · 2011
The dynamic tasks scheduling of parallel tasks in multiprocessor systems is still a demanding problem that is being investigated by the researchers. However, the Directed Acyclic Graph (DAG) based dynamic tasks scheduling is not yet paid enough attention. In this paper a DAG based dynamic tasks scheduling model and a scheduling algorithm DYTAS (DYnamic TAsk Scheduling algorithm) has been proposed with a lower time complexity. Furthermore, the simulation experiments show that, the scheduling model and scheduling algorithm are feasible, a higher scheduling successful ratio may be obtained by this algorithm for parallel jobs with large number of tasks. General Terms Parallel program, Directed Acyclic Graph.