- Volume 6 Issue 9
Recently, Baruah et.al. proposed an optimal Pfair scheduling algorithm in the hard real-time multiprocessor environments, and several variants of it were presented. All these algorithms assume the fixed unit quantum size, and this assumption has two problems in the mode change environments. If the quantum size is too large, it results in the scheduling failure due to the decreased processor utilization. If it is too small, it increases the frequency of scheduling points, and it incurs the task switching overheads. In this paper, we propose several methods that determine the maximum quantum size dynamically such that the task set can be scheduled in the mode change environments.