Sciweavers

98 search results - page 7 / 20
» An Improved Schedulability Test for Uniprocessor Periodic Ta...
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 5 months ago
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
I-Hong Hou, P. R. Kumar
JSW
2007
96views more  JSW 2007»
13 years 6 months ago
Dynamic Scheduling of Skippable Periodic Tasks: Issues and Proposals
Abstract— This paper deals with dynamic scheduling in realtime systems that have Quality of Service requirements. We assume that tasks are periodic and may miss their deadlines, ...
Maryline Silly-Chetto, Audrey Marchand
RTSS
2000
IEEE
13 years 10 months ago
Efficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
Damir Isovic, Gerhard Fohler
FMSD
2007
133views more  FMSD 2007»
13 years 6 months ago
Static priority scheduling of event-triggered real-time embedded systems
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
Cagkan Erbas, Andy D. Pimentel, Selin Cerav-Erbas
IPPS
2007
IEEE
14 years 1 months ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...