An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor

2011/04/18 by Paul Regnier, Regnier, Paul, George Lima +3
Computer Science · #68M20 #98B35 #C.3.3 #Distributed systems and fault tolerance #Embedded Systems Design Techniques #FOS: Computer and information sciences #Operating Systems (cs.OS) #Real-Time Systems Scheduling

paper · pdf · doi:10.48550/arxiv.1104.3523

openalex publication_date 2011/04/18 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

An optimal solution to the problem of scheduling real-time tasks on a set of identical processors is derived. The described approach is based on solving an equivalent uniprocessor real-time scheduling problem. Although there are other scheduling algorithms that achieve optimality, they usually impose prohibitive preemption costs. Unlike these algorithms, it is observed through simulation that the proposed approach produces no more than three preemptions points per job.

Related

• On the Design of an Optimal Multiprocessor Real-Time Scheduling Algorithm under Practical Considerations (Extended Version)
• Integrating Job Parallelism in Real-Time Scheduling Theory
• Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
• Schedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm
• Precise Schedulability Analysis for unfeasible to notify separately for comprehensive - EDF Scheduling of interrupted Hard Real-Time Tasks on the similar Multiprocessors