The Algorithms of Dynamic Servers for Scheduling Aperiodic Real-Time Tasks – A Review

This paper focus on the dynamic server algorithms, and the servers are used for scheduling soft aperiodic tasks. Many types of servers and their schedulability analysis are reviewed, these properties can be used for constructing hierarchical embedded systems, where the soft aperiodic tasks and the hard real-time tasks can be scheduled in the same system. The aperiodic tasks in the server are not preemptable, and they are executed in a first-come first-served (FCFS) manner. If it is not specified, there is only one server in the system, and rest of the processes in the system are ordinary periodic tasks. The servers could be scheduled by fixed priority or dynamic algorithms.