115 search results - page 1 / 23 » Scheduling The Can Bus With Earliest Deadline Techniques |
RTSS
2000
IEEE
13 years 9 months ago
2000
IEEE
ISLPED
2007
ACM
13 years 6 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
MSWIM
2004
ACM
13 years 10 months ago
2004
ACM
— Providing delay guarantees to time-sensitive traffic in future wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the vari...
RTSS
1994
IEEE
13 years 9 months ago
1994
IEEE
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...