End-to-end flows, which have a set of chainlike subtasks, are widely used in distributedreal-timesystems. For instance, multimedia and automative applications require that subtasks finish executing on a chain of pro...
详细信息
ISBN:
(纸本)9781450347877
End-to-end flows, which have a set of chainlike subtasks, are widely used in distributedreal-timesystems. For instance, multimedia and automative applications require that subtasks finish executing on a chain of processors before their end-to-end deadlines. The scheduling of such chained subtasks decides the schedulability of a distributedreal-timesystem. Since the subtask priority assignment problem is NP-hard in general, most heuristics are presented to schedule end-to-end flows in two separate steps. The first step calculates intermediate relative deadlines for frames, and the second step makes scheduling decisions under EDF scheduling. Because the quality of the priority assignment of subtasks will directly affect the schedulability of the distributedsystems, the two separate steps may cause pessimism in schedulability analysis. To reduce potential pessimism, we combine the two steps in our novel dGMF-PA (distributed generalized multiframe tasks with parameter adaption) model. We present an algorithm based on mixed-integer linear programming for optimally selecting frame relative deadlines in the dGMF-PA model. An approximation algorithm is also proposed to reduce computational running time. Our approximation algorithm has a tunable speed-up factor of 1 + epsilon where epsilon can be arbitrarily small, with respect to the exact schedulability test of dGMF-PA tasks under EDF scheduling. Extensive experiments have shown that our approximation algorithm (which is a sufficient schedulability test) can schedule at most 44 % more than HOSPA, an existing state-of-the-art algorithm.
暂无评论