An effective scheduling algorithm for distributed real-time embedded (DRE) system

Aim: The introduction of the full paper believes that the existing scheduling algorithms are ineffective for a DRE system. Subsection 3.1 establishes the model for the DRE system. Subsection 3.2 does three things: (1) it discusses the design of the model prediction controller (MPC); (2) we transform the nonlinear constrained optimization problem for the MPC into a multi-parameter quadratic programming problem; (3) the scheduling algorithm proposed by us maintains the CPU utilization of each processor around reference values, satisfies the end-to-end deadline of a task and thus greatly reduces its execution time. Section 4 did two experiments to verify our scheduling algorithm. The experimental results, given respectively in Figs. 2 and 3 for Experiment I and Table 2 for Experiment II, and their comparison show preliminarily that the workload and computation time of our scheduling algorithm are much less than those of the existing scheduling algorithms, thus being effective for resource-limited DRE systems.