Scheduling Bounded Predictable (BP) and Soft Aperiodic Tasks

摘要

The aim of this paper is to provide scheduling algorithms for the joint scheduling of BP and soft aperiodic tasks. In this paper, we present four scheduling algorithms for servicing soft aperiodic tasks in real-time systems, where a set of BP tasks is scheduled using the BP scheduling algorithm. A goal of these scheduling algorithms is to guarantee the hard deadlines of BP tasks while providing good response times for soft aperiodic tasks. The result of the scheduling algorithms will allow the real-time system designers to reason with confidence about timing constraints of highly dynamic behavior environments.