Open Access   Article Go Back

A Review on Ready Queue Processing Time Estimation Problem and Methodologies used in Multiprocessor Environment

Sarla More1 , Diwakar Shukla2

  1. Department of computer science and Applications, Dr. Harisingh Gour Vishwavidyalaya, Sagar, India.
  2. Department of computer science and Applications, Dr. Harisingh Gour Vishwavidyalaya, Sagar, India.

Section:Review Paper, Product Type: Journal Paper
Volume-6 , Issue-5 , Page no. 1186-1191, May-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i5.11861191

Online published on May 31, 2018

Copyright © Sarla More, Diwakar Shukla . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Sarla More, Diwakar Shukla, “A Review on Ready Queue Processing Time Estimation Problem and Methodologies used in Multiprocessor Environment,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.1186-1191, 2018.

MLA Style Citation: Sarla More, Diwakar Shukla "A Review on Ready Queue Processing Time Estimation Problem and Methodologies used in Multiprocessor Environment." International Journal of Computer Sciences and Engineering 6.5 (2018): 1186-1191.

APA Style Citation: Sarla More, Diwakar Shukla, (2018). A Review on Ready Queue Processing Time Estimation Problem and Methodologies used in Multiprocessor Environment. International Journal of Computer Sciences and Engineering, 6(5), 1186-1191.

BibTex Style Citation:
@article{More_2018,
author = {Sarla More, Diwakar Shukla},
title = {A Review on Ready Queue Processing Time Estimation Problem and Methodologies used in Multiprocessor Environment},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2018},
volume = {6},
Issue = {5},
month = {5},
year = {2018},
issn = {2347-2693},
pages = {1186-1191},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2130},
doi = {https://doi.org/10.26438/ijcse/v6i5.11861191}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i5.11861191}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2130
TI - A Review on Ready Queue Processing Time Estimation Problem and Methodologies used in Multiprocessor Environment
T2 - International Journal of Computer Sciences and Engineering
AU - Sarla More, Diwakar Shukla
PY - 2018
DA - 2018/05/31
PB - IJCSE, Indore, INDIA
SP - 1186-1191
IS - 5
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
574 292 downloads 247 downloads
  
  
           

Abstract

CPU scheduling is a technique by which the processes in the system are able to be allocated the processor and by execution they perform their intended task. In order to this various scheduling schemes are available with their own merits and demerits. Lottery scheduling is one of the best algorithms to schedule the processes for the processor so that all processes get executed with the ease of convenience with better efficiency. Lottery scheduling solves many problems of previous scheduling schemes, starvation is one of them, flexible and fair share of resources to each and every process is possible with this scheme. This paper illustrates the various methods provided in the field of CPU scheduling and in the basic function of operating system that is process management to calculate the ready queue estimation time. Ready queue is responsible for holding the processes which needs to be allocated to the CPU for execution. It contains heterogeneous type of processes from the multiprocessor environment. The lottery scheduling scheme allows each process with its specific characteristics to share the resources and execute accordingly. Processes have the dynamic characteristics of creation, activation, waiting, execution, sharing, pre-emption, interruption and termination. The time spent by the processes in the ready queue waiting for CPU is a crucial time because it predicts the performance efficiency of the CPU. The problem of time estimation of ready queue processing is represented in this paper with various associated constraints to better evaluate the results. The working of lottery scheduling scheme and various algorithms which are derived from it are represented here. The summarized version of the existing work represented here to better understand the problem and predict the new possibilities in this area.

Key-Words / Index Term

scheduling algorithms, multiprocessor, process management, ready queue, estimation, operating system.

References

[1] C. A. Waldspurger, W. E. Weihl, "Lottery Scheduling: Flexible Proportional-Share resource Management", The 1994 Operating Systems Design and Implementation conference (OSDI`94), Monterey, California, 1994.
[2] D. Shukla, A. Jain and A. Choudhary, "Estimation of Ready Queue Processing Time under SL Scheduling Scheme in Multiprocessors Environment", International Journal of Computer Science and Security, vol.4, Issue.1, pp.74-81, 2010
[3] D. Shukla, A. Jain and A. Choudhary, "Estimation of Ready Queue Processing Time under Usual Group Lottery Scheduling (GLS) in Multiprocessor Environment", International Journal of Computer Applications,Vol.8, Issue.14, pp.39-45, 2010
[4] D. Shukla, A. Jain and A. Choudhary, "Prediction of Ready Queue Processing Time in Multiprocessor Environment using Lottery Scheduling (ULS)", International Journal of Computer Internet and Management, Vol.18, Issue.3, pp 58-65, 2010
[5] D. Shukla and A. Jain, "Analysis of Ready Queue Processing Time under PPS-LS and SRS-LS Scheme in Multiprocessing Environment", GESJ: Computer Science and Tele-communications, Vol. 33, Issue.1, pp.54-65, 2012
[6] D. Shukla and A. Jain, "Estimation of Ready Queue Processing Time using Efficient Factor Type Estimator (E-F-T) in Multiprocessor Environment", International Journal of Computer Applications, Vol.48, Issue.16, pp.20-27, 2012,
[7] D. Shukla and A. Jain, "Ready Queue Mean Time Estimation in Lottery Scheduling using Auxiliary Variables in Multiprocessor Environment", International Journal of Computer Applications, Vol. 55, Issue.13, pp.13-19, 2012
[8] D. Shukla and A. Jain, "Estimation of Ready Queue Processing Time using Factor Type (F-T) Estimator in Multiprocessor Environment", COMPUSOFT, An international journal of advanced computer technology, Vol.2, Issue.8, pp.256-260, 2013
[9] D. Shukla, A. Jain and K. Verma, "Estimation of Ready Queue Processing Time using Transformed Factor-Type (T-F-T) Estimator in Multiprocessor Environment", International Journal of Computer Applications, Vol.79, Issue.16, pp.40-48, 2013
[10] A. Silberschatz and P. Galvin, “Operating System Concepts”, John Wiley and Sons (Asia), Ed.5, 1999.
[11] W. Stalling, “Operating System”, Pearson Education, Singapore, Indian Edition, New Delhi, Ed.5, 2000.
[12] A. Tanenbaum and Woodhull, “Operating system”, Prentice Hall of India, New Delhi, Ed.8, 2000
[13] W. G. Cochran, "sampling Technique", Wiley Eastern Publication, New Delhi, 2005.
[14] S. Thompson, "Sampling", Wiley Eastern Publication, 3rd edition