Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preemptive uniprocessor scheduling for mixed-criticality systems

In this paper we implement the EDF-VD (Earliest Deadline First with Virtual Deadline) algorithm described in [1] for scheduling mixed-criticality, realtime task systems on preemptive uniprocessor platforms. We compare the scheduling overheads of this algorithm with the scheduling overheads of the well known EDF (Earliest Deadline First) algorithm for scheduling realtime task systems on preempti...

متن کامل

Mixed-Criticality Scheduling of Sporadic Task Systems

We consider the scheduling of mixed-criticality task systems, that is, systems where each task to be scheduled has multiple levels of worst-case execution time estimates. We design a scheduling algorithm, EDF-VD, whose effectiveness we analyze using the processor speedup metric: we show that any 2-level task system that is schedulable on a unit-speed processor is correctly scheduled by EDF-VD u...

متن کامل

Improving the Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems

An increasing trend in embedded system design is to integrate components with different levels of criticality into a shared hardware platform for better cost and power efficiency. Such mixed-criticality systems are subject to certifications at different levels of rigorousness, for validating the correctness of different subsystems on various confidence levels. The realtime scheduling of certifi...

متن کامل

The Partitioned Multiprocessor Scheduling of Non-preemptive Sporadic Task Systems∗

We consider polynomial-time algorithms for partitioning a collection of non-preemptive or restricted-preemption tasks among the processors of an identical multiprocessor platform. Since the problem of partitioning tasks among processors (even with unlimited preemption) is NP-hard in the strong sense, these algorithms are unlikely to be optimal. For task systems where the ratio between the large...

متن کامل

Fault-Tolerant Task Scheduling for Mixed-Criticality Real-Time Systems

Integration of safety-critical tasks with di®erent certi ̄cation requirements onto a common hardware platform has become a growing tendency in the design of real-time and embedded systems. In the past decade, great e®orts have been made to develop techniques for handling uncertainties in task worst-case execution time, quality-of-service, and schedulability of mixedcriticality systems. However, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the ACM

سال: 2015

ISSN: 0004-5411,1557-735X

DOI: 10.1145/2699435