A post-scheduling optimization algorithm of distributed real-time tasks

To overcome the disadvantages of existing algorithms in scheduling distributed real-time tasks, this paper proposes a post-scheduling optimization algorithm (PSO) based on a novel structure called Scheduled Clusters Tree. As the experiments shows, PSO can minimize the number of required processors without affecting the optimal scheduling length generated by duplication-based algorithms, e.g., TDS or OSA algorithm. The time complexity of PSO algorithm is O(d vertical bar V vertical bar(2)) when TDS is adopted, or O(d(2)vertical bar V vertical bar(2)) when OSA is adopted Where vertical bar V vertical bar is the number of tasks and d is the maximum degree of tasks in the corresponding DAG.