Artificial Intelligence
Scheduling Periodic Jobs that Allow Imprecise Results
IEEE Transactions on Computers
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Algorithms for scheduling imprecise computations with timing constraints
SIAM Journal on Computing
Image transfer: an end-to-end design
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Scheduling algorithms for fault-tolerance in hard-real-time systems
Real-Time Systems - Special issue on responsive computer systems
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A Value-Driven System for Autonomous Information Gathering
Journal of Intelligent Information Systems
Real-Time Systems
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
IEEE Transactions on Computers
APPROXIMATE: A Query Processor that Produces Monotonically Improving Approximate Answers
IEEE Transactions on Knowledge and Data Engineering
Fairness in periodic real-time scheduling
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A resource allocation model for QoS management
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Energy reduction techniques for multimedia applications with tolerance to deadline misses
Proceedings of the 40th annual Design Automation Conference
Power management points in power-aware real-time systems
Power aware computing
Maximizing rewards for real-time applications with energy constraints
ACM Transactions on Embedded Computing Systems (TECS)
Journal of Systems and Software
Power-Aware Scheduling for Periodic Real-Time Tasks
IEEE Transactions on Computers
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Dynamic Task-Level Voltage Scheduling Optimizations
IEEE Transactions on Computers
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
Real-time task scheduling with fuzzy uncertainty in processing times and deadlines
Applied Soft Computing
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
System-wide energy minimization for real-time tasks: Lower bound and approximation
ACM Transactions on Embedded Computing Systems (TECS)
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Leakage-aware dynamic scheduling for real-time adaptive applications on multiprocessor systems
Proceedings of the 47th Design Automation Conference
Optimal task execution times for periodic tasks using nonlinear constrained optimization
The Journal of Supercomputing
Energy- and performance-aware scheduling of tasks on parallel and distributed systems
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Compositional real-time scheduling framework for periodic reward-based task model
Journal of Systems and Software
International Journal of Web and Grid Services
Hi-index | 14.99 |
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and an optional part. The mandatory part must complete before the task's deadline, while a nondecreasing reward function is associated with the execution of the optional part, which can be interrupted at any time. Imprecise computation and Increased-Reward-with-Increased-Service models fall within the scope of this framework. In this paper, we address the reward-based scheduling problem for periodic tasks. An optimal schedule is one where mandatory parts complete in a timely manner and the weighted average reward is maximized. For linear and concave reward functions, which are most common, we 1) show the existence of an optimal schedule where the optional service time of a task is constant at every instance and 2) show how to efficiently compute this service time. We also prove the optimality of Rate Monotonic Scheduling (with harmonic periods), Earliest Deadline First, and Least Laxity First policies for the case of uniprocessors when used with the optimal service times we computed. Moreover, we extend our result by showing that any policy which can fully utilize all the processors is also optimal for the multiprocessor periodic reward-based scheduling. To show that our optimal solution is pushing the limits of reward-based scheduling, we further prove that, when the reward functions are convex, the problem becomes NP-Hard. Our static optimal solution, besides providing considerable reward improvements over the previous suboptimal strategies, also has a major practical benefit: Run-time overhead is eliminated and existing scheduling disciplines may be used without modification with the computed optimal service times.