131 search results - page 12 / 27 » Scheduling Tasks with Markov-Chain Based Constraints |
AIPS
2003
13 years 9 months ago
2003
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
TPDS
2008
13 years 7 months ago
2008
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
RTSS
2007
IEEE
14 years 1 months ago
2007
IEEE
Recent technological advances have opened up several distributed real-time applications involving battery-driven embedded devices with local processing and wireless communication ...
ECRTS
1999
IEEE
13 years 12 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...