A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor

We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the distribution and the scheduling of these tasks onto a multiprocessor is an NP-hard problem we propose a greedy heuristic to solve it. Our heuristic sequences three algorithms: assignment, unrolling, and scheduling. The tasks of the same, or multiple, periods are assigned to the same processor according to a mixed sort. Then, the initial graph of tasks is unrolled, i.e. each task is repeated according to the ratio between its period and the least common multiple of all periods of tasks. Finally, the tasks of the unrolled graph are distributed and scheduled onto the processors where they have been assigned. Then, we give the complexity of this heuristic, and we illustrate it with an example. A performance analysis comparing our heuristic with an optimal Branch and Cut algorithm concludes that our heuristic is ...

• Type: Conference
• Year: 2007
• Where: ISCAPDCS
• Authors: Omar Kermia, Yves Sorel
• Keywords: Acyclic Directed Graph, Dependent Periodic Tasks, Distributed And Parallel Computing, Heuristic, ISCAPDCS 2007