Skip to Main Content
The real-time scheduling algorithms play an important role in real-time systems. Whether or not the real-time tasks could be completed within the specified deadline mainly relies on scheduling algorithms. This article proposes a sectional real-time scheduling algorithm called SS (sectional scheduling), and this algorithm divides the system load into three cases according to the intension of system load: normal load, overload and serious overload. Every case utilizes a different algorithm. The experimental results show that this algorithm could improve real-time system performance remarkably compared to the classical EDF (earliest deadline first), HVF (highest value first) and HVDF (highest value density first) algorithms under all workload conditions.