University of North Carolina
In this paper, the authors discuss the Soft Real-Time (SRT) multiprocessor scheduling, tardiness bounds have been derived for a variety of scheduling algorithms, most notably, the Global Earliest-Deadline-First (G-EDF) algorithm. In this paper, the authors devise G-EDF-Like (GEL) schedulers, which have identical implementations to G-EDF and therefore the same overheads, but that provide better tardiness bounds. They discuss how to analyze these schedulers and propose methods to determine scheduler parameters to meet several different tardiness bound criteria. They employ linear programs to adjust such parameters to optimize arbitrary tardiness criteria, and to analyze lateness bounds (lateness is related to tardiness).