Sciweavers

357 search results - page 60 / 72
» Scheduling optional computations in fault-tolerant real-time...
Sort
View
RTCSA
2006
IEEE
14 years 1 months ago
Computing the Minimum EDF Feasible Deadline in Periodic Systems
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...
Hoai Hoang, Giorgio C. Buttazzo, Magnus Jonsson, S...
RTAS
2007
IEEE
14 years 1 months ago
Resource-Locking Durations in EDF-Scheduled Systems
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...
Nathan Fisher, Marko Bertogna, Sanjoy K. Baruah
RTCSA
2008
IEEE
14 years 2 months ago
Scheduler-Assisted Prefetching: Efficient Demand Paging for Embedded Systems
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...
Stanislav A. Belogolov, Jiyong Park, Jungkeun Park...
RTCSA
2003
IEEE
14 years 28 days ago
Scheduling Jobs with Multiple Feasible Intervals
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...
Chi-Sheng Shih, Jane W.-S. Liu, Infan Kuok Cheong
EUROPAR
2000
Springer
13 years 11 months ago
Scheduling Queries for Tape-Resident Data
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...
Sachin More, Alok N. Choudhary