Author : Manish Vyas 1
Date of Publication :7th October 2016
Abstract: In multi process scheduling to ensure that no has excessively waiting for execution or resources, fairness is desired in predictable and responsive way. In case of innovative real time applications a fair share scheduler is required during execution to ensure that all resources will be allocated through fair manner on share and usage criteria. By fair share scheduling, improved processor utilization can be achieved by assigning dynamically priorities to executing processes. In this paper elementary scheme of multi process fair share scheduling is considered and by putting certain state of affairs over it, one more scheduling scheme is shaped. Comparative study of obtained scheme with elementary one is analyzed through simulation study under Markova chain model.
Reference :