List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
Estimation of Ready Queue Processing Time Under Systematic Lottery Scheduling Scheme
Full text
 PDF(117.2KB)
Source 
International Journal of Computer Science and Security (IJCSS)
Table of Contents
Download Complete Issue    PDF(3.86MB)
Volume:  4    Issue:  1
Pages:  1-148
Publication Date:   March 2010
ISSN (Online): 1985-1553
Pages 
74 - 81
Author(s)  
D. Shukla - India
Anjali Jain - India
 
Published Date   
26-03-2010 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   systematic lottery scheduling, ready queue, cpu 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Directory of Open Access Journals (DOAJ)
2. Scribd
3. PDFCAST
4. Docstoc
5. ScientificCommons
6. CiteSeerX
7. WorldCat
8. Google Scholar
9. ResearchGATE
10. Bielefeld Academic Search Engine (BASE)
11. Academic Index
12. iSEEK
13. Socol@r
14. Academic Journals Database
15. Libsearch
16. slideshare
 
 
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 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).
 
 
 
 
 
 
 
 
D. Shukla : Colleagues
Anjali Jain : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.