Sciweavers

506 search results - page 16 / 102
» State-Dependent Deadline Scheduling
Sort
View
ECRTS
2007
IEEE
14 years 4 months ago
Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors
We present a multiprocessor scheduling framework for integrating hard and soft real-time tasks and best-effort jobs. This framework allows for full system utilization, and ensures...
Björn B. Brandenburg, James H. Anderson
TC
2008
13 years 9 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
CCGRID
2011
IEEE
13 years 1 months ago
Towards Real-Time, Volunteer Distributed Computing
Many large-scale distributed computing applications demand real-time responses by soft deadlines. To enable such real-time task distribution and execution on the volunteer resourc...
Sangho Yi, Emmanuel Jeannot, Derrick Kondo, David ...
IPPS
2008
IEEE
14 years 4 months ago
Portioned static-priority scheduling on multiprocessors
This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on...
Shinpei Kato, Nobuyuki Yamasaki
ECRTS
2003
IEEE
14 years 3 months ago
An Improved Schedulability Test for Uniprocessor Periodic Task Systems
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an ...
UmaMaheswari C. Devi