Scheduling Aperiodic Requests in the Presence of Hard Real-Time Tasks with Linear Timing Constraints

摘要

This paper considers the problem of scheduling aperiodic requests in the presence of hard realtime tasks with linear timing constraints. This problem may arise when designing control real-time systems. A scheduling algorithm for aperiodic requests that can reduce the average aperiodic response time in comparison with the Slack Stealing algorithm is proposed. The proposed algorithm is based on the fact that it considers initial real-time constraints belonging to a class of linear timing constraints and thereby prolongs the deadlines of hard real-time requests, which frees up additional time for execution of aperiodic requests.