Dynamic Pfair Scheduling Using an Improved Reach Function
Hyuntae Park, In Guk Kim · The Journal of the Institute of Webcasting, Internet and Telecommunication · 2011
The Pfair scheduling algorithm, which is an optimal algorithm in the hard real-time multiprocessor environments, is based on the fixed quantum size. Recently, several methods that can determine the optimal quantum dynamically are developed in the mode change environments. These methods are based on the reach function and in many cases, we have to do the sequential search to find the optimal quantum. In this paper, we propose a new scheduling method, based on the improved reach function, that can determine the optimal quantum more quickly.