Deadline-based scheduling of periodic task systems on multiprocessors.
We consider the problem of scheduling periodic task systems on multiprocessors and present a deadline-based scheduling algorithm for solving this problem. We show that our algorithm successfully schedules on \(m\) processors any periodic task system with utilization at most \(m^2/(2m-1)\).
scientific article; zbMATH DE number 1856460