Partitioned Rate-monotonic Scheduling of the Burchard Kind: Exploiting Circular Period Similarity


Dr. Dirk Müller (TU Chemnitz, Fakultät für Informatik)


For Rate-monotonic Scheduling (RMS) on a uniprocessor, there is a steady transition between the two extremes Liu/Layland worst case and simply periodic task set (best case) in terms of utilization bound. The degree of harmonicity is only based on period ratios. A standard approach to describe harmonicity relies on the linear range of S values, the fractional parts of period logarithms, as proposed by Burchard et al. But using linear range leads to pessimistic utilization bound estimations not being scale-invariant. Such inconsistencies will be pointed out and resolved by using circular instead of linear range of S values with a multitude of consequences both for the sufficient uniprocessor schedulability test and the partitioned multiprocessor scheduling known as Rate-monotonic Small-Tasks (RMST).


Müller, Dirk, Dr.-Ing., Dipl.-Inf.; 1995 High school diploma (Abitur) with deepened mathematical-scientific education at Johannes-Kepler-Gymnasium Chemnitz; Studies of Medical Informatics at University of Leipzig including 2 semesters abroad studies at Mid Sweden University in Sundsvall in Sweden; 2006 Graduation to Dr.-Ing., dissertation 'Sub-pixel filtering for an autostereoscopic multi-perspective 3-D representation of high quality' in informatics at University of Kassel; 2006-2008 Research Associate at Philipps-University of Marburg with topics Idea of Man and IT as well as Model-driven Software Development; Since 2008 Assistant Professor (Akademischer Rat) and habilitating (topic real-time scheduling) at TU Chemnitz, Operating Systems Group