CPU scheduling defines the policy for deciding which of the available process in ready queue will be dispatched next to CPU by the scheduler; so that the resource utilization and overall performance of the system could be improved. Many traditional CPU scheduling algorithms have been proposed by several authors. Lottery scheduling is one of the well organized random based scheduling algorithms. It has random based ticket allocation algorithm in which one or more tickets are randomly assigned to each Process and when CPU becomes available the winner process is selected next for assignment. In this paper, we calculated the performance of the deadlock condition. The state transition from one process to another process is done by using Markov chain model and also data set based approach is used to study different transition states. The overall performances in terms of unequal and equal numerical data set are analyzed and then comparative analysis is performed to justify the results.

Multiprocessing Environment ,Markov chain, CPU- scheduling, lottery scheduling, Process ,Deadlock Condition.

[1]. D. Shukla & S. Ojha(2010). “Deadlock index analysis of multi-level queue scheduling in operating system using data model approach”, GESJ, 6(29), pp. 93-110.
[2]. Ruesh sendre & R.Singhai(2018). “Deadlock Analysis of Improved Round Robin CPU Scheduling Algorithm Using Markov Chain Model ,IJREAM 4(4) .
[3]. A. Silberschatz, P.B. Galvin & G. Gagne (2016). Operating Systems Concepts, 9th edition, John Wiley & Sons Publication.
[4]. D.M. Dhamdhere, (2012). Operating Systems: A Concept Based Approach, 3rd edition, Tata McGraw-Hill Publication.
[5]. Petrou, D., Milford, J. W., & Gibson, G. A. (1999). “Implementing Lottery Scheduling: Matching the Specializations in Traditional Schedulers”. In USENIX Annual Technical Conference, General Track , pp. 1-14.
[6]. Carl.A.Waldspurger, & William E. Weihl(1994). “Lottery scheduling Flexible Proportional –share resource management”. IT laboratory for computer science, Cambridge.
[7]. Shweta Ojha & Saurabh jain (2011). “Hybrid Lottery multilevel queue scheduling with a Markov Model” GESJ Computer Science and Telecommunication, 03(32).
[8]. S. Reveliotis, &Z. Fei ( 2017). “Robust deadlock avoidance for sequential resource allocation systems with resource outages”, IEEE Transactions on automation science and engineering, 14(4), pp-1696-1711.
[9]. P. Kawadkar, S. Prasad & A.D. Dwivedi(2014). “Deadlock Avoidance based on banker’s algorithm for waiting state Processes”, IJISME, 2(12), pp. 1-2.
[10]. S. Srinivasan & R. Rajaram(2011).“A decentralized deadlock detection and resolution algorithm for generalized model in distributed systems”, Springer-Diatribe Parallel Databases, Vol 29, pp. 261-276.
[11]. D. Pandey & Vandana(2010). “Improved round robin policy a mathematical approach”, IJCSE, 2(4) pp. 948-964.
[12]. S.H. Yadgire & Y.B. Jadhav(2017).“Analysis of deadlock with fungible resources”, IJRSE, 3(3), pp. 290-294.
[13]. Y. Cai & W.K. Chan(2014). “Magiclock- scalable detection of potential deadlocks in large-scale multithreaded Programs”, IEEE Transaction on Software Engineering, 40(3), pp. 266-281.
[14]. Brzezinski J., Helary J.M., Raynal M. & Singhal M(2002).“Deadlock Models and a general algorithm for distributed deadlock detection”, Journal of Parallel & Distributed Computing, 31(2), pp. 112-126.
[15]. A. Nazeem, S. Reveliotis, Y. Wang & S. Lafortune(2011). “Designing compact and maximally permissive deadlock avoidance policies for complex resource allocation systems through classification theory: the linear case”, IEEE Transactions on automatic control, 66(8), pp. 1818-1833.
[16]. Y. Rosa, A. Shahyar & R. Vahid,( 2016). “A greedy algorithm versus metaheuristic solutions to deadlock detection in graph transformation systems”, JIFS, 31(1), pp. 137-149,
[17]. Manish Vyas, & Dr. Saurabh Jain(2016).”Stochastic Modeling for Analyzing Scalability Impact of Lottery Scheduling using Proportion Reformation“ International Journal Of Engineering And Computer Science ,6(10), pp. 18668-18674.
[18]. Manish Vyas,& Dr. Saurabh Jain(2016).” Comparative Study of Extensive Round Robin Scheduling by Data Model Approach under Markov Chain” International Journal of Recent Research Aspects, 3(2), pp. 92-100.
[19]. D.shukla & Sweta ojha(2010).”Prediction of Ready Queue Processing Time in Multiprocessor Environment Using Lottery Scheduling (ULS)” International Journal of the Computer, the Internet and Management Vol.18.pp 68-66.
[20]. D. Shukla & S. Jain,(2007). “A Markov chain model for multi-level queue scheduler in operating system”, Proceedings of the International Conference on Mathematics and Computer Science, ICMCS-07, pp. 622-626.
[21]. R. Sendre, R. Singhai& S. Jain(2018). “Markov Chain Analysis of Improved Round Robin CPU Scheduling Algorithm”, IJREAM, 3(4), pp. 728-737.
[22]. I.S. Rajput, & D. Gupta(2012). “A Priority based round robin CPU scheduling algorithm for real time systems”, IJIET, 1(3), pp. 01-11.
[23]. D. Shukla & S. Jain(2007) .“A Markov chain model for multi-level queue scheduler in operating system”, Proceedings of the International Conference on Mathematics and Computer Science, ICMCS-07, pp. 622-626.
[24]. D. Shukla & S. Jain(2007). “Deadlock State Study in Security Based Multilevel Queue Scheduling Scheme in Operating System”, Proceedings of National Conference on Network Security and Management, NCNSM-07, pp. 166-176.
[25]. J. Medhi(1991). “Stochastic Processes” Ed. 4, Wiley Limited (Fourth Reprint), New Delhi,
[26]. P.K. Jatav & R. Singhai(2018). “Comparative Study of CPU Scheduling Algorithms based on Markov Chain”, IJREAM, 4(3), pp. 668-672.
[27]. A.K. Gupta, N.S. Yadav & D. Goyal(2017). “Review of Round Robin CPU Scheduling Algorithm on Varying Time Quantum”, IJESI, 6(8), pp. 68-72.
[28]. A.S. Tenenbaum & A.S. Woodhull(2012). Operating Systems: Design and Implementation, 3rd edition, PHI Publication.
[29]. J. Medhi(1991). “Stochastic Models in Queuing Theory”, Academic Press Professional, Inc, San Diego, CA.