524 search results - page 31 / 105 » Off-line scheduling of a real-time system |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
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 ...
ISORC
2000
IEEE
14 years 4 days ago
2000
IEEE
This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach which applies tolerance to timing vio...
JSSPP
2005
Springer
14 years 1 months ago
2005
Springer
Real-time applications with security requirements are emerging in various areas including government, education, and business. The security sensitive real-time applications can ta...
RTSS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...