Building on the BACKSLASH Algorithm ; CU-CS-1022-06
Wang-ting Lin, Gary J Nutt · CU Scholar (University of Colorado Boulder) · 2006
Contemporary computer systems often mix real-time and non real-time (best effort) work, due to the increasing range of applications.Contemporary scheduling algorithms in such an environment may use earliest deadline first scheduling along with slack time scheduling.This paper describes some additions made to the BACKSLASH slack time scheduling algorithm.It introduces the idea of early release of work under certain circumstances.The paper also introduces a refined measure of the deadline attainment performance of tasks in such a system.Finally, we address a problem in which tasks that dramatically under book their actual processor needs can produce the effect of a denial of service attack on the other tasks in the system.