Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems
نویسندگان
چکیده
منابع مشابه
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...
متن کاملSemi-Partitioned Scheduling for Resource-Sharing Hard-Real-Time Tasks
As real-time embedded systems integrate more and more functionality, they are demanding increasing amounts of computational power that can only be met by deploying them on powerful multi-core architectures. Efficient task allocation and scheduling on such architectures is paramount. Multicore scheduling algorithms for independent real-time tasks has been the focus of much research over the year...
متن کامل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...
متن کاملReal-Time scheduling: from hard to soft real-time systems
Real-time systems are traditionally classified into hard real-time and soft real-time: in the first category we have safety critical real-time systems where missing a deadline can have catastrophic consequences, whereas in the second class we find systems for which we need to optimise the Quality of service provided to the user. However, the frontier between these two classes is thinner than on...
متن کاملXoncrete: a scheduling tool for partitioned real-time systems
ARINC 653 defines a partitioned framework where the partitions are scheduled according to a predefined cyclic plan and the processes of each partition are scheduled with a fixed priority policy. The timing characteristics defined in ARINC (period and duration) can hardly be used to precisely represent the timing requirements of the applications. We extend the timing model of ARINC 653 to consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Signal Processing Systems
سال: 2015
ISSN: 1939-8018,1939-8115
DOI: 10.1007/s11265-015-0983-7