Partitioned scheduling of parallel real-time tasks on multiprocessor systems
نویسندگان
چکیده
منابع مشابه
Robust Partitioned Scheduling for Real-Time Multiprocessor Systems
In this paper, we consider the problem of fixed-priority partitioned scheduling of sporadic real-time tasks for homogeneous processors. We propose a partitioning heuristic that takes into account possible Worst Case Execution Time (WCET) overruns. Our goal is to maximize the duration a task can be allowed to exceed its WCET without compromising the timeliness constraints of all the tasks. This ...
متن کاملImproved Partitioned Queue Scheduling in Multiprocessor Soft Real Time Systems
Multiprocessor scheduling in real time systems follows global queue and partitioned queue methods. Partitioned queue scheduling technique organised with dedicated queues and tasks are scheduled to corresponding processor, based on Earliest Deadline First (EDF) algorithm. EDF is an optimal technique to schedule aperiodic, periodic and sporadic tasks in Real Time Systems (RTS). Deadline of the ta...
متن کاملThe Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms
We consider the partitioned scheduling of sporadic, hard-realtime tasks on a multiprocessor platform with static-priority scheduling policies. Most previous work on the static-priority scheduling of sporadic tasks upon multiprocessors has assumed implicit deadlines (i.e. a task’s relative deadline is equal to its period). We relax the equality constraint on a task’s deadline and consider task s...
متن کاملOnline Semi-Partitioned Multiprocessor Scheduling of Soft Real-Time Periodic Tasks for QoS Optimization
In this paper, we propose a novel semipartitioning approach with an online choice of two approximation algorithms, Greedy and Load-Balancing, to schedule periodic soft real-time tasks in homogeneous multiprocessor systems. Our objective is to enhance the QoS by minimizing the deadline misses and maximizing the total reward or benefit obtained by completed tasks in minimum response time. Many re...
متن کاملDynamic Scheduling of Real-Time Aperiodic Tasks on Multiprocessor Architectures
The application of static optimization techniques such as branch-and-bound to real-time task scheduling has been investigated. Few pieces of work, however, have been reported which propose and investigate online optimization techniques for dynamic scheduling of real-time tasks. In such task domains, the d@iculty of scheduling is exacerbated by the fact that the cost of scheduling itself contrib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGBED Review
سال: 2011
ISSN: 1551-3688,1551-3688
DOI: 10.1145/2038617.2038623