262 search results - page 3 / 53 » End-to-End Scheduling to Meet Deadlines in Distributed Syste... |
RTS
2002
13 years 7 months ago
2002
Distributed real-time applications usually consist of several component tasks and must be completed by its end-to-end (E-T-E) deadline. As long as the E-T-E deadline of an applicat...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
DSN
2002
IEEE
14 years 12 days ago
2002
IEEE
—Advanced automotive control applications such as steer-by-wire are typically implemented as distributed systems comprising many embedded processors, sensors, and actuators inter...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...
TPDS
1998
13 years 7 months ago
1998
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...