Simulation of Process Scheduling Algorithms IJTSRD


In a multiprogramming system, multiple processes exist concurrently in main memory. Each process alternates between using a processor and waiting for some event to occur, such as the completion of an I O operation. The processor or processors are kept busy by executing one process while the others wait. The key to multiprogramming is scheduling. CPU scheduling deals with the problem of deciding which of the processes in the ready queue is to be allocated the CPU. By switching the CPU among processor the operating system can make the computer more productive. Scheduling affectes the performance of the system because it determines which processes will wait and which will progress. In this paper, simulation of various scheduling algorithm First Come First Served FCFS , Round Robin RR , Shortest Process Next SPN and Shortest Remaining Time SRT is done over C

BY Daw Khin Po “Simulation of Process Scheduling Algorithms”

Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019,

URL: https://www.ijtsrd.com/papers/ijtsrd25124.pdf

Paper URL: https://www.ijtsrd.com/computer-science/operating-system/25124/simulation-of-process-scheduling-algorithms/daw-khin-po

call for paper Computer Architecture, international journal Data Miining, ugc approved journals Embedded System




Simulation of Process Scheduling Algorithms IJTSRD IEEE PAPER





2020 technology trends
2019-TOP-TECHNOLOGIES
2019 papers
2018-TOP-TECHNOLOGIES
2018 papers

IEEE PROJECTS 2019


IEEE PROJECTS CSE 2019
IEEE PROJECTS ECE 2019
IEEE PROJECTS EEE 2019
IEEE PROJECTS VLSI
IEEE PROJECTS EMBEDDED SYSTEM

IEEE PROJECTS


IEEE PROJECTS ECE
IEEE PROJECTS CSE COMPUTER SCIENCE
IEEE PROJECTS ELECTRICAL ENGINEERING
IEEE PROJECTS EEE

IEEE PROJECTS