Open Access   Article Go Back

Effectiveness of Teaching and Learning CPU Scheduling Algorithms: A Survey

Sudhir K. Pandey1 , Gopal Krishna2

Section:Survey Paper, Product Type: Journal Paper
Volume-07 , Issue-14 , Page no. 146-151, May-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7si14.146151

Online published on May 15, 2019

Copyright © Sudhir K. Pandey, Gopal Krishna . 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

XML View
PDF Download

How to Cite this Paper

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

IEEE Style Citation: Sudhir K. Pandey, Gopal Krishna, “Effectiveness of Teaching and Learning CPU Scheduling Algorithms: A Survey,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.14, pp.146-151, 2019.

MLA Style Citation: Sudhir K. Pandey, Gopal Krishna "Effectiveness of Teaching and Learning CPU Scheduling Algorithms: A Survey." International Journal of Computer Sciences and Engineering 07.14 (2019): 146-151.

APA Style Citation: Sudhir K. Pandey, Gopal Krishna, (2019). Effectiveness of Teaching and Learning CPU Scheduling Algorithms: A Survey. International Journal of Computer Sciences and Engineering, 07(14), 146-151.

BibTex Style Citation:
@article{Pandey_2019,
author = {Sudhir K. Pandey, Gopal Krishna},
title = {Effectiveness of Teaching and Learning CPU Scheduling Algorithms: A Survey},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2019},
volume = {07},
Issue = {14},
month = {5},
year = {2019},
issn = {2347-2693},
pages = {146-151},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=1110},
doi = {https://doi.org/10.26438/ijcse/v7i14.146151}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i14.146151}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=1110
TI - Effectiveness of Teaching and Learning CPU Scheduling Algorithms: A Survey
T2 - International Journal of Computer Sciences and Engineering
AU - Sudhir K. Pandey, Gopal Krishna
PY - 2019
DA - 2019/05/15
PB - IJCSE, Indore, INDIA
SP - 146-151
IS - 14
VL - 07
SN - 2347-2693
ER -

           

Abstract

CPU scheduling algorithms are integral part of learning operating system. Over the years, it has been experience that initially CS students face a lot of problems in understanding and further implementing the various Scheduling algorithm. Also generating and regenerating Gantt Charts is faced with difficulties by many CS students. However, teaching and learning CPU scheduling algorithms using conventional lectures and textbooks is faced with difficulties by many students. First, textbooks illustrate the CPU scheduling algorithms in an incomplete and unclear manner. Second, students solve problems manually. They don’t receive any immediate feedback on their solutions. Third, due to time restriction, the teacher has to select a few small problems. To overcome these problems, this can be used as an efficient tool for teaching and learning CPU scheduling algorithms. The tool is also capable of doing calculations different effectiveness criteria of an algorithm like waiting time of each process, average waiting time and turnaround time.

Key-Words / Index Term

CPU utilization and system throughput

References

[1] S. Abraham, Peter B. Galvin and Greg Gagne, “Operating System
Concepts, ” 9th ed., John Wiley & Sons, 2012.
[2] S. William, “Operating systems: internal and design principles,” 8th ed., Prentice Hall, Person Education, 2015.
[3] William Stallings Operating Systems ISBN 0-13-031999-63241 Prentice Hall
[4] Gen M., and Cheng, R., "Genetic Algorithms and population. Out of the above final Design" John Wiley & Sons Inc. 2000.
[5] S. Grissom, M. McNally, and T. Naps, “Algorithm visualization in CS education: comarison levels of student engagement,” Proceedings of the 2003 ACM Symposium on Software Virtualization, pp. 87-94, 2003.
[6] ufDmoarnnn, Jp. pa.n6d29-Gi6r5s4c.h, M. (1994) Genetic Operators Based on Constraint Repair, [6] uf Dmoarnnn, Jp. pa.n6d29-Gi6r5s4c.h, M. (1994) Genetic Operators Based on Constraint Repair, ECAI`94 Workshop on Applied Genetic and other Evolutionary Algorithms, Amsterdam, August 9.