96 search results - page 10 / 20 » Quasi-Static Scheduling for Real-Time Systems with Hard and ... |
RTSS
2003
IEEE
14 years 27 days ago
2003
IEEE
We address the problem of providing compositional hard real-time guarantees in a hierarchy of schedulers. We first propose a resource model to characterize a periodic resource al...
AGENTS
1999
Springer
13 years 12 months ago
1999
Springer
We describe the interface between a real-time resource allocation system with an AI planner in order to create fault-tolerant plans that are guaranteed to execute in hard real-tim...
RTAS
2003
IEEE
14 years 27 days ago
2003
IEEE
A reward-based task typically consists of a mandatory part that must be accomplished before the given deadline, and an optional part that is associated with rewards for partial co...
IPPS
2003
IEEE
14 years 27 days ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...