Advertisement

Some New Methods for Ready Queue Processing Time Estimation Problem in Multiprocessing Environment

  • Sarla MoreEmail author
  • Diwakar Shukla
Conference paper
  • 19 Downloads
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 100)

Abstract

Ready queue processing time estimation problem deals with many constraints. Because the processes which reside in the ready queue of computer memory come in varieties such as process size, process requirement indifferences and process types. To match up all these differences is a difficult task to solve so that the processes can be used to perform its task efficiently at any platform. A prior estimation of ready queue processing time helps to meet the system reliability and robustness. A pre-calculated time will ensure the system from failure; also, the backup of task performed can be maintained. In this paper, the existing methods on this approach are described, and how some new methods can be used for the better performance is demonstrated. For this purpose, some sampling techniques are used, and the lottery scheduling procedure is explained which very efficiently performs this task of scheduling on the basis of probabilistic approach and randomness property. The estimation is performed by using sampling methods; with the help of some mathematical calculations, the results are obtained, and finally, confidence interval will ensure the accuracy of the result. So that some new methods can be generated; this provides the result as more efficient than the previous ones. Although various scheduling schemes are available, the lottery scheduling scheme provides the fairness and also removes starvation. Rather than working on the complete data set, some samples can be generated to modularize the work which will be efficient too. So, this paper proposed some new methods in ready queue processing time estimation in multiprocessor environment.

Keywords

Ready queue Multiprocessing Process management Lottery scheduling Estimation Sampling 

References

  1. 1.
    Waldspurger CA, Weihl WE (1994) Lottery scheduling: flexible proportional share resource management. In: Proceedings of the 1994 operating system design and implementation conference (OSDI’94). Monterey, California, pp 1–11Google Scholar
  2. 2.
    Shukla D, Jain A, Choudhary A (2010) Estimation of ready queue processing time under SL scheduling scheme in multiprocessor environment. Int J Comput Sci Secur 4:74–81Google Scholar
  3. 3.
    Shukla D, Jain A, Choudhary A (2010) Estimation of ready queue processing time under usual group lottery scheduling in multiprocessor environment. Int J Comput Appl 8:39–45Google Scholar
  4. 4.
    Shukla D, Jain A, Choudhary A (2010) Prediction of ready queue processing time in multiprocessor environment using lottery scheduling. Int J Comput Internet Manag 18:58–65Google Scholar
  5. 5.
    Shukla D, Jain A (2012) Analysis of ready queue processing time under PPS-LS and SRS-LS scheme in multiprocessing environment. GESJ: Comput Sci Telecommun 33:54–65Google Scholar
  6. 6.
    Shukla D, Jain A (2012) Estimation of ready queue processing time using efficient factor type estimator (E-F-T) in multiprocessor environment. Int J Comput Appl 48:20–27Google Scholar
  7. 7.
    Shukla D, Jain A (2012) Ready queue mean time estimation in lottery scheduling using auxiliary variables in multiprocessor environment. Int J Comput Appl 55:13–19Google Scholar
  8. 8.
    Shukla D, Jain A (2013) Estimation of ready queue processing time using Factor type (F-T) estimator in multiprocessor environment. Compusoft, Int J Adv Comput Technol 2:256–260Google Scholar
  9. 9.
    Shukla D, Jain A, Verma K (2013) Estimation of ready queue processing time using transformed factor type (T-F-T) estimator in multiprocessor environment. Int J Comput Appl 79:40–48Google Scholar
  10. 10.
    Silberschatz A, Galvin P (1999) Operating system concepts, 5th edn. Wiley (Asia)Google Scholar
  11. 11.
    Stalling W (2000) Operating system. Pearson education, Singapore, Indian edition, 5th edn. New DelhiGoogle Scholar
  12. 12.
    Tanenbaum A, Woodhull (2000) Operating system, 8th edn. Prentice Hall of India, New DelhiGoogle Scholar
  13. 13.
    Cochran WG (2005) Sampling techniques. Wiley Eastern Publication, New DelhizbMATHGoogle Scholar
  14. 14.
    Thompson S Sampling, 3rd edn. Wiley Eastern PublicationGoogle Scholar
  15. 15.
    More S, Shukla D (2018) A Review on ready queue processing time estimation problem and methodologies used in multiprocessor environment. Int J Comput Sci Eng 6:1186–1191Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Dr. Harisingh Gour UniversitySagarIndia

Personalised recommendations