Processing aggregate relational queries with hard time constraints
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Depth-limited search for real-time problem solving
Real-Time Systems
Extending a blackboard architecture for approximate processing
Real-Time Systems
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Algorithms for scheduling imprecise computations with timing constraints
SIAM Journal on Computing
Performance evaluation of scheduling algorithms for imprecise computer systems
Journal of Systems and Software
On-Line Processor Scheduling for a Class of IRIS (Increasing Reward with Increasing Service Real-Time Tasks
Scheduling for Overload in Real-Time Systems
IEEE Transactions on Computers
Optimal Reward-Based Scheduling for Periodic Real-Time Tasks
IEEE Transactions on Computers
Comment on 'On-Line Scheduling Policies for a Class of IRIS Real-Time Tasks'
IEEE Transactions on Computers
Towards energy-aware software-based fault tolerance in real-time systems
Proceedings of the 2002 international symposium on Low power electronics and design
IEEE Transactions on Computers
Real-Time Scheduling of Hierarchical Reward-Based Tasks
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Maximizing rewards for real-time applications with energy constraints
ACM Transactions on Embedded Computing Systems (TECS)
Voltage-Clock-Scaling Adaptive Scheduling Techniques for Low Power in Hard Real-Time Systems
IEEE Transactions on Computers
Maximizing the system value while satisfying time and energy constraints
IBM Journal of Research and Development
Energy aware kernel for hard real-time systems
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
Frequency-aware energy optimization for real-time periodic and aperiodic tasks
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Adaptivity for quality and timeliness flexible real-time systems
ARCS'05 Proceedings of the 18th international conference on Architecture of Computing Systems conference on Systems Aspects in Organic and Pervasive Computing
| Hi-index | 0.03 |
In this paper we consider the problem of on-line scheduling of real-time tasks which receive a "reward" that depends on the amount of service received. In our model, tasks have associated deadlines at which they must depart the system. The task computations are such that the longer they are able to execute before their deadline, the greater the value of their computations, i.e., the tasks have the property that they receive increasing reward with increasing service (IRIS). We focus on the problem of scheduling IRIS tasks in a system in which tasks arrive randomly over time, with the goal of maximizing the average reward accrued per task and per unit time. We describe and evaluate a two-level policy for this system. A top-level algorithm executes each time a task arrives and determines the amount of service to allocate to each task in the absence of future arrivals. A lower-level algorithm, an earliest deadline first (EDF) policy in our case, is responsible for the actual selection of tasks to execute. This two-level policy is evaluated through a combination of analysis and simulation, We observe that it provides nearly optimal performance when the variance in the interarrival times and/or laxities is low and that the performance is more sensitive to changes in the arrival process than the deadline distribution.