Improving the Schedulability of LLF Scheduling Algorithm in Multiprocessor Real-Time Systems
Junghee Han, Sangchul Han · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2012
LLF(Least Laxity First) is a dynamic priority scheduling algorithm that gives higher priority to an active job with less laxity. It is known that LLF is optimal on uniprocessor but not on multiprocessor. This paper presents LazyLLF(Lazy Least Laxity First) scheduling algorithm which is a modification of LLF. LazyLLF reduces processor idle time by allowing temporary priority inversion, so that it improves the schedulability of LLF. This paper proves that LazyLLF strictly dominates LLF, and compares the schedulability of LazyLLF and LLF through simulation.