Scheduling for Reliable Execution in Autonomic Systems

Abstract. Scheduling the execution of multiple concurrent tasks on shared resources such as CPUs and network links is essential to ensuring the reliable operation of many autonomic systems. Well known techniques such as rate-monotonic scheduling can offer rigorous timing and preemption guarantees, but only under assumptions (i.e., a fixed set of tasks with well-known execution times and invocation rates) that do not hold in many autonomic systems. New hierarchical scheduling techniques are better suited to enforce the more flexible execution constraints and enforcement mechanisms that are required for autonomic systems, but a rigorous foundation for verifying and enforcing concurrency and timing guarantees is still needed for these approaches. The primary contributions of this paper are: (1) a scheduling policy design technique that can use different decision models across a wide range of systems models, and an example of how a specific (Markov Decision Process) decision model can be a...

• Type: Conference
• Year: 2008
• Where: ATC
• Authors: Terry Tidwell, Robert Glaubius, Christopher D. Gill, William D. Smart
• Keywords: Applied Computing, ATC 2008, Autonomic Systems, Scheduling Policy, Scheduling Policy Design