CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Ready Queue Mean Time Estimation in Lottery Scheduling using Auxiliary Variables in Multiprocessor Environment

by D. Shukla, Anjali Jain
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 55 - Number 13
Year of Publication: 2012
Authors: D. Shukla, Anjali Jain
10.5120/8814-2453

D. Shukla, Anjali Jain . Ready Queue Mean Time Estimation in Lottery Scheduling using Auxiliary Variables in Multiprocessor Environment. International Journal of Computer Applications. 55, 13 ( October 2012), 13-19. DOI=10.5120/8814-2453

@article{ 10.5120/8814-2453,
author = { D. Shukla, Anjali Jain },
title = { Ready Queue Mean Time Estimation in Lottery Scheduling using Auxiliary Variables in Multiprocessor Environment },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 55 },
number = { 13 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 13-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume55/number13/8814-2453/ },
doi = { 10.5120/8814-2453 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:57:07.356002+05:30
%A D. Shukla
%A Anjali Jain
%T Ready Queue Mean Time Estimation in Lottery Scheduling using Auxiliary Variables in Multiprocessor Environment
%J International Journal of Computer Applications
%@ 0975-8887
%V 55
%N 13
%P 13-19
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The ready queue estimation problem appears when many processes remain in the ready queue after the sudden failure. The system manager has to decide immediately how much further time is required to process all the remaining jobs in the ready queue. In lottery scheduling, this prediction is possible with the help of sampling techniques. To strengthen the prediction methodology, the auxiliary source of data is often utilized. This paper considers the three additional data sources as (i) process size (ii) process priority and (iii) process expected time. The Ratio method, existing in sampling literature, is used to predict the time required for remaining jobs after failure. A comparative study between different auxiliary sources has been made. It is found that highly correlated source of auxiliary information provides better processing time prediction.

References
  1. Carl A. Waldspurger and William E. Weihl 1994 Lottery Scheduling a flexible proportional-share resource management. In Proceedings of the 1st USENIX Symposium on Operating Systems Design and Implementation (OSDI), p1.
  2. Carl A. Waldspurger, Weihl, W. 1996 An Object-Oriented Framework for Modular Resource Management. In: Proceedings of the Fifth International Workshop on Object Orientation in Operating Systems, p 138.
  3. Cochran 2005 Sampling Technique, Wiley Eastern Publication, New Delhi.
  4. Shukla, D, Jain, Saurabh and Ojha, Shweta 2010 Effect of Data Model Approach for the Analysis of Multi-Level Queue Scheduling, International Journal of Advanced Networking and Applications, Vol. 2 Issue 1, p 419.
  5. Shukla,D. and Jain, Saurabh 2009 Analysis of Thread scheduling with multiple processors under a Markov chain model, Journal of Computer Science, Vol. 3 , Issue 5, p 78.
  6. Shukla,D. , Jain, Saurabh and Singh, Umesh 2008 A Markov chain model for Deficit Round Robin Alternated (DRRA) scheduling algorithm. In Proceedings of the International Conference on Mathematics and Computer Science, ICMCS-08, p 52.
  7. David Petrou, Garth A. Gibson and John W. Milford 1999 Implementing Lottery Scheduling: Matching the specializations in Traditional Schedulers. In Proceedings of the USENIX Annual Technical Conference USA, p 66.
  8. Raz, D. , B. Itzahak and H. Levy 2004 Classes, Priorities and Fairness in Queuing Systems, Research report, Rutgers University.
  9. Shukla D. , Jain, Saurabh 2010 A Stochastic Model Approach for Reaching Probabilities of Message Flow in Space-Division Switches. International Journal of Computer Networks, Vol. 2, Issue 2, p 140.
  10. Shukla, D. and Jain, Saurabh 2007 A Markov chain model for multilevel queue scheduler in operating system. In Proceedings of International Conference on Mathematics and Computer Science, ICMCS-07, p. 522.
  11. Shukla, D. and Jain, Saurabh 2007 Deadlock state study in security based multilevel queue scheduling scheme in operating system. In Proceedings of National Conference on Network Security and Management, NCNSM-07, p 166.
  12. Shukla, D. Ojha, Shweta 2010 Analysis of multilevel queue with effect of data model approach. In Proceedings of National Conference on Research and Development Trends in ICT, 12-13 Feb. , p 245.
  13. Shukla, D. , Jain, Anjali 2010 Estimation of ready queue processing time under SL scheduling scheme in multiprocessor environment. International Journal of Computer Science and Security (IJCSS), Vol. 4(1), p 74.
  14. Shukla,D. , Jain, Anjali and Choduary, Amita 2010 Estimation of ready queue processing time under Usual Group Lottery Scheduling(GLS) in Multiprocessor Environment. International Journal of Computer and Applications (IJCA), Vol. 8, No. 14, p 39.
  15. Shukla,D. , Jain, Anjali and Choduary, Amita 2011 Estimation of ready queue processing time under Usual Lottery Scheduling(ULS) in Multiprocessor Environment. Journal of Applied Computer Science and Mathematics (JACSM), Vol. 11, No 11, p 39.
  16. Shukla,D. and Jain, Anjali 2012 Analysis of Ready Queue Processing Time under PPS-LS and SRS-LS scheme in Multiprocessing Environment. GESJ: Computer Science and Telecommunication, No. 1 (33), pp. 54-61.
  17. Shukla,D. and Jain, Anjali 2012 Estimation of Ready Queue Processing Time Using Efficient Factor Type (E-F-T) Estimator in Multiprocessor environment, International Journal of Computer and Applications (IJCA), Vol. 48, No. 16, pp. 20-27.
  18. Silberschatz, A. and Galvin, P. 1999 Operating System Concepts, Ed. 5, John Wiley and Sons (Asia), Inc.
  19. Singh, Daroga and Choudhary, F. S. 1986 Theory and Analysis of Sample Survey and Designs, Wiley Eastern Limited, New Delhi.
  20. Stalling, W. 2004 Operating Systems, Ed. 5, Pearson Education, Singapore, Indian Edition, New Delhi.
  21. Tanenbaum, A. 2000 Operating system, Ed. 8, Prentice Hall of India, New Delhi.
  22. Yiping Ding, William Flynn 2000 Interpreting Windows NT Processor Queue Length Measurements. In Proceedings of the 31st Computer Measurement Group Conference, Vol. 2, p 759.
  23. Yiping Ding 2000 On the Performance Impact of Fair Share Scheduling. In Proceedings of the Computer Measurement Group Conference, p 71.
Index Terms

Computer Science
Information Sciences

Keywords

Scheduling Ratio Estimator Bias Variance Confidence Interval Ready Queue Expected Time (et) Size(s) Priority (p)

Powered by PhDFocusTM