Task allocation and scheduling algorithm based on dynamic dual-directional priority
Liu Jian-jun · Journal of Computer Applications · 2009
A task allocation and scheduling algorithm called Dynamic Dual-Directional Priority(DDDP) was presented.This algorithm considered the priority of real-time task and the sub synthetically,and constructed a dynamic dual-directional priority task allocation model,realized the task allocation and scheduling of the master/sub model in data transmission.In the simulation experiments with some typical data of various parameters under normal workload and overload situation,the DDDP algorithm has improved the performance of scheduling obviously compared with a classical Earliest Deadline First(EDF) algorithm which only considers the deadlines of real-time tasks.