This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Comparison Analysis of CPU Scheduling : FCFS, SJF and Round Robin
Authors
Andysah Putera Utama Siahaan
Abstract
Task scheduling is needed to maintain every process that comes with a processor in parallel processing. In several conditions, not every algorithm works better on the significant problem. Sometimes FCFS algorithm is better than the other in short burst time while Round Robin is better for multiple processes in every single time. However, it cannot be predicted what process will come after. Average Waiting Time is a standard measure for giving credit to the scheduling algorithm. Several techniques have been applied to maintain the process to make the CPU performance in normal. The objective of this paper is to compare three algorithms, FCFS, SJF, and Round Robin. The target is to know which algorithm is more suitable for the certain process.
Keywords- FCFS, SJF, Round Robin, Schedule, Operating System.
Publication Details
Unique Identification Number - IJEDR1603022Page Number(s) - 124-132Pubished in - Volume 4 | Issue 3 | July 2016DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
Andysah Putera Utama Siahaan, "Comparison Analysis of CPU Scheduling : FCFS, SJF and Round Robin", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.4, Issue 3, pp.124-132, July 2016, Available at :http://www.ijedr.org/papers/IJEDR1603022.pdf
Article Preview
|
|
||||||
|
|
||||||||
