Schedulability Analysis for Directed Acyclic Graphs on Multiprocessor Systems at a Subtask Level
نوع المنشور
بحث أصيل
المؤلفون

This paper addresses the problem of scheduling parallel real-time tasks of Directed Acyclic Graph (DAG) model on multiprocessor systems. We propose a new scheduling method based on a subtask-level, which means that the schedulability decisions are taken based on the local temporal parameters of subtasks. This method requires modifying the subtasks to add more parameters which are necessary for the analysis, such as local offsets, deadlines and release jitters. Then we provide interference and workload analyses of DAG tasks, and we provide a schedulability test for any work conserving scheduling algorithm.

المجلة
العنوان
Reliable Software Technologies – Ada-Europe 2014
الناشر
Springer International Publishing
بلد الناشر
سويسرا
نوع المنشور
Both (Printed and Online)
المجلد
8454
السنة
2014
الصفحات
119-133