longer than the adaptive algorithm. For ordinary tasks, the execution time is higher than
executed locally. Our algorithm adopts priority mechanism and dynamic assignment
algorithm, which fully guarantees the real-time performance of high-priority tasks.
Fig. 4. Average execution time of high-priority tasks with increasing number of tasks
Fig. 5. Average time required for algorithms to execute under different task priorities
146
Y. Zhu et al.