Online Submission!

Open Journal Systems

Estimation of Ready Queue Processing Time using Factor-Type (F-T) Estimator in Multiprocessor Environment

Anjali Jain, Diwakar Shukla

Abstract


The ready queue processing 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. Ratio method, existing in sampling literature, was previously used by authors to predict the time required for remaining jobs to finish after failure, provided that highly correlated source of auxiliary information provides better processing time prediction. This paper proposes two new estimators and which are compared with previously defined ratio estimator in terms of total processing time. Under large sample approximation the bias and m.s.e of proposed estimators have been obtained in the set up of lottery scheduling. The confidence intervals are calculated for the numerical support to the theoretical findings. A T B T


Full Text:

PDF

References


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).

Cochran. 2005. Sampling Technique, Wiley Eastern Publication, New Delhi.

David, P., Garth, A. Gibson and John, W. M. 1999. Implementing Lottery Scheduling: Matching the specializations in Traditional Schedulers. In Proceedings of the USENIX Annual Technical Conference USA.

Raz, D., Itzahak, B. and Levy, H. 2004. Classes, Priorities and Fairness in Queuing Systems. Research report. Rutgers University.

Shukla, D. and Jain, S. 2010. A Stochastic Model Approach for Reaching Probabilities of Message Flow in Space-Division Switches. International Journal of Computer Networks.

Shukla, D., Jain, S. and Ojha, S. 2010. Effect of Data Model Approach for the Analysis of Multi-Level Queue Scheduling. International Journal of Advanced Networking and Applications.

Shukla, D. and Jain, S. 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.

Shukla, D. and Jain, A. 2010. Estimation of ready queue processing time under SL scheduling scheme in multiprocessor environment. International Journal of Computer Science and Security (IJCSS).

Shukla, D. and Jain, S. 2009. Analysis of Thread scheduling with multiple processors under a Markov chain model. Journal of Computer Science.

Shukla, D. and Jain, A. 2011. Analysis of Ready Queue Processing Time under PPS-LS and SRS-LS scheme in Multiprocessing Environment. GESJ: Computer Science and Telecommunication.

Shukla, D., Jain, A. and Choudhary, A. 2010. Estimation of ready queue processing time under Usual Group Lottery Scheduling (GLS) in Multiprocessor Environment. International Journal of Computer and Applications (IJCA).

Shukla, D., Jain, A. and Choudhary, A. 2011. Estimation of ready queue processing time under Usual Lottery Scheduling (ULS) in Multiprocessor

Environment. Journal of Applied Computer Science and Mathematics (JACSM).

Shukla, D., Jain, S. and Singh, U. 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.

Singh, V.K. and Shukla, D. 1987. An efficient one-parameter family of factor-type estimator in sample surveys, METRON International Journal of Statistics.

Silberschatz, A. and Galvin, P. 1999. Operating System Concepts. Ed.5, John Wiley and Sons (Asia), Inc.

Singh, D. and Choudhary, F.S. 1986. Theory and Analysis of Sample Survey and Designs, Wiley Eastern Limited, New Delhi.

Stalling, W. 2004. Operating Systems, Ed.5, Pearson Education, Singapore, Indian Edition, New Delhi.

Tanenbaum, A. 2000. Operating system, Ed. 8, Prentice Hall of India, New Delhi.

Yiping, D. and William, F. 2000. Interpreting Windows NT Processor Queue Length Measurements. In Proceedings of the 31st Computer Measurement Group Conference.




DOI: http://dx.doi.org/10.6084/ijact.v2i8.362

Refbacks

  • There are currently no refbacks.




Copyright (c) 2015 COMPUSOFT "An International Journal of Advanced Computer Technology"