摘要:Scheduling computations in multi-environment systems is a complex and challenging problem. Scarce resources must be multiplexed to service requests of varying importance. Lottery scheduling is a randomized mechanism that provides responsive control over the relative execution rates of computations. But, once the tickets are allotted to the competing jobs, they are forced to move in the defined pattern. This paper introduces the concept of Multileveled queues with lottery scheduling which will provide options for further upgradation to the processes which are in execution. A Markov Chain model based study has been done to deal with transitions of processes into processor under this proposed scheme. A data model based simulation study is performed to analyze the result.