Sciweavers

64 search results - page 5 / 13
» Scheduling Self-Suspending Real-Time Tasks with Rate-Monoton...
Sort
View
PRDC
2006
IEEE
14 years 1 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
TC
2008
13 years 7 months ago
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in ...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo
RTS
2006
138views more  RTS 2006»
13 years 7 months ago
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single-queue m-server system allows for arbitrary fixed task priorities and arbitrary...
Theodore P. Baker
RTAS
2006
IEEE
14 years 1 months ago
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
Xue Liu, Tarek F. Abdelzaher
RTSS
2007
IEEE
14 years 1 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns