Analysis and Extension of Methods in Ready Queue Processing Time Estimation in Multiprocessor Environment
6 Pages Posted: 12 Jun 2019
Date Written: February 23, 2019
Abstract
Lottery scheduling is a technique which is based on probabilistic approach and randomness. Selection of processes from ready queue performed randomly and a fair share of resources is done with some probabilistic value so that the problem of starvation has no place. The advancement of lottery scheduling schemes is described here and compared to each other to find out the best one method. By using lottery scheduling scheme and sampling methods (Ratio estimation) the estimation of total processing time of ready queue processes is performed to get the estimated time. If system fails suddenly or other disaster happens in the system, the predicted time will safeguard the system and also for the backup requirements the predicted time is very much useful. In the multiprocessor environment the estimation of ready queue processing time with the modified lottery scheduling algorithm is performed. To calculate the ready queue processing time the mean and variance of the sampled processes is obtained and to check efficiency of the result the confidence interval is calculated. Here systematic lottery scheduling scheme is explained and other modified lottery scheduling schemes are compared to obtain a best approach in future.
Suggested Citation: Suggested Citation