Inserting a new task quickly and smoothly
Qian Guang-ming · Journal of Hunan University of Arts and Science · 2008
A time δi ' for inserting new tasks is given, formally proved, and simply demonstrated based on the well-known EDF(Earliest Deadline First) algorithm in a real-time system, from which on new tasks can be inserted at run-time without causing any deadline miss in the system. Buttazzo and his fellows have offered a time δi . But δi ', produced by applying the processor demand criterion from the starting of task set, is earlier than δi . This time point can be applied in the load adjustment of network QoS, and for the sensor target approaching measurement, etc.