Laxity Dynamics and LLF Schedulability Analysis on Multiprocessor Platforms

Provided by: Springer Healthcare
Topic: Hardware
Format: PDF
LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with a smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, little work has been made to illuminate its characteristics upon multiprocessor platforms. In this paper, the authors identify the dynamics of laxity from the system's viewpoint and translate the dynamics into LLF multiprocessor schedulability analysis. More specifically, they characterize laxity properties under LLF scheduling, focusing on laxity dynamics associated with a deadline miss.

Find By Topic