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.
@article{arxiv.1104.3523,
title = {An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor},
author = {Paul Regnier and George Lima and Ernesto Massa},
journal= {arXiv preprint arXiv:1104.3523},
year = {2011}
}