Dynamic Scheduling Strategies for Firm Semi-Periodic Real-Time Tasks

Abstract

This paper introduces and assesses novel strategies to schedule firm semi-periodic real-time tasks. Jobs are released periodically and have the same relative deadline. Job execution times obey an arbitrary probability distribution and can take either bounded or unbounded values. We investigate several optimization criteria, the most prominent being the Deadline Miss Ratio (DMR). All previous work uses some admission policies but never interrupt the execution of an admitted job before its deadline. On the contrary, we introduce three new control parameters to dynamically decide whether to interrupt a job at any given time. We derive a Markov model and use its stationary distribution to determine the best value of each control parameter. Finally we conduct an extensive simulation campaign with 16 different probability distributions. The results nicely demonstrate how the new strategies help improve system performance compared with traditional approaches. In particular, we show that (i) compared to pre-execution admission rules, the control parameters make significantly better decisions; (ii) specifically, the key control parameter is to upper bound the waiting time of each job; (iii) the best scheduling strategy decreases the DMR by up to 0.35 over traditional competitors.

Validation of Task Scheduling Techniques in Multithread Time Predictable Systems

“…We were able to achieve a 100% fulfillment rate of task completion time, i.e. DMR=0% [36] for all tasks. Although there are situations in which certain tasks may be completed clearly before their deadlines, this situation is particularly true for SHT tasks.…”

“…The methodology was based on analyzing the timing conditions on a specially constructed Worst Case Timing Analyzer (WCTA), which makes it possible at the system design stage to accurately analyze the timing of the system. Unlike other approaches where the authors analyze Deadline Miss Ratio (DMR) [36], this solution does not allow any task to exceed the deadline time.…”