Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(117.16KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
Publications from CSC-OpenAccess Library are being accessed from over 74 countries worldwide.
Estimation of Ready Queue Processing Time Under Systematic Lottery Scheduling Scheme
D. Shukla, Anjali Jain
Pages - 74 - 81     |    Revised - 25-02-2010     |    Published - 26-03-2010
Volume - 4   Issue - 1    |    Publication Date - March 2010  Table of Contents
MORE INFORMATION
KEYWORDS
systematic lottery scheduling, ready queue, cpu
ABSTRACT
This paper presents a scheduling scheme which provides lottery tickets (containing random numbers) to each process in the ready queue. The CPU has a unit to draw random numbers, whenever a scheduling decision has to be made, a random number is generated by CPU and the process in ready queue holding that number gets selected to utilize the resource. This paper presents an estimate of total processing time of all processes in the ready queue. A simulation study is incorporated to support the findings.
1 Google Scholar 
2 Academic Journals Database 
3 ScientificCommons 
4 Academic Index 
5 CiteSeerX 
6 iSEEK 
7 Socol@r  
8 ResearchGATE 
9 Libsearch 
10 Bielefeld Academic Search Engine (BASE) 
11 Scribd 
12 WorldCat 
13 SlideShare 
14 PDFCAST 
15 PdfSR 
1 Ankur Agarwal “System-Level Modeling of a Network-on-Chip”, International Journal of Computer Science and Security (IJCSS), 3(3):154-174, 2009.
2 Agarwal, Rinki and Kaur Lakhwinder “On flexibility analysis of fault tolerant multistage interconnection networks, International Journal of Computer Science and Security (IJCSS),2(4), 01 – 08,2008.
3 Carl A. Waldspurger William E. Weihl “Lottery Scheduling a flexible proportional-share resource management”, Proceedings of the 1st USENIX Symposium on Operating Systems Design and Implementation (OSDI): 1-11, 1994.
4 Cochran, W.G “Sampling Technique”, Wiley Eastern Publication, New Delhi 2005.
5 David Petrou, Garth A. Gibson, John W. Milford “Implementing Lottery Scheduling: Matching the specializations in Traditional Schedulers”, Proceedings of the USENIX Annual Technical Conference USA: 66-80, 1999.
6 Raz, D., B. Itzahak, H. Levy “Classes, Priorities and Fairness in Queuing Systems”. Research report, Rutgers University, 2004.
7 Shukla, D. and Jain, Saurabh. “A Markov chain model for multilevel queue scheduler in operating system, Proceedings of International Conference on Mathematics and Computer Science, ICMCS-07, pp. 522-526, 2007.
8 Shukla, D. and Jain, Saurabh. “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-175, 2007.
9 Shukla, D. and Jain, Saurabh “A Markov chain model for Deficit Round Robin Alternated (DRRA) scheduling algorithm”, Proceedings of the International Conference on Mathematics and Computer Science, ICMCS-08: 52-61, 2008.
10 Shukla D., Tiwari Virendra, Thakur Sanjay, And Deshmukh, A. K. “Share Loss Analysis of Internet Traffic Distribution in Computer Networks” International Journal of Computer Science And Security(IJCSS), 3(5): 414- 427,2009.
11 Shukla D., Tiwari Virendra, Thakur Sanjay, And Tiwari Mohan “A comparison of methods for internet traffic in computer network”, International Journal of Advance Networking and Applications, 1(3): 164- 169, 2009.
12 Shukla D., Ojha, Shweta, And Jain, Sourabh, “Analysis of multilevel queue with the effect of data model approach”, Proceedings of the National Conference on Research and Development Trends in ICT (NCRTICT – 10), 245- 251, 2010.
13 Silberschatz, A. and Galvin, P. “Operating System Concepts”, Ed.5, John Wiley and Sons (Asia), Inc. (1999)
14 Stalling, W. “Operating System”, Ed.5, Pearson Education, Singapore, Indian Edition, New Delhi. (2004)
15 Tanenbaum, A. and Woodhull “Operating system”, Ed. 8, Prentice Hall of India, New Delhi,(2000).
Dr. D. Shukla
- India
Dr. Anjali Jain
- India