357 search results - page 60 / 72 » Scheduling optional computations in fault-tolerant real-time... |
115
click to vote
RTCSA
2006
IEEE
15 years 6 months ago
2006
IEEE
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
102
Voted
RTAS
2007
IEEE
15 years 6 months ago
2007
IEEE
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...
84
Voted
RTCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
In an attempt to substitute NOR flash with NAND flash and provide more memory to applications, embedded systems have to use demand paging. However, demand paging drastically degra...
107
click to vote
RTCSA
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
86
Voted
EUROPAR
2000
Springer
15 years 4 months ago
2000
Springer
Tertiary storage systems are used when secondary storage can not satisfy the data storage requirements and/or it is a more cost effective option. The new application domains requir...