Open Access   Article Go Back

Performance Analysis of Disk Scheduling Algorithms

C.Mallikarjuna 1 , P.Chitti Babu2

Section:Review Paper, Product Type: Journal Paper
Volume-4 , Issue-5 , Page no. 180-184, May-2016

Online published on May 31, 2016

Copyright © C.Mallikarjuna, P.Chitti Babu . 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: C.Mallikarjuna, P.Chitti Babu, “Performance Analysis of Disk Scheduling Algorithms,” International Journal of Computer Sciences and Engineering, Vol.4, Issue.5, pp.180-184, 2016.

MLA Style Citation: C.Mallikarjuna, P.Chitti Babu "Performance Analysis of Disk Scheduling Algorithms." International Journal of Computer Sciences and Engineering 4.5 (2016): 180-184.

APA Style Citation: C.Mallikarjuna, P.Chitti Babu, (2016). Performance Analysis of Disk Scheduling Algorithms. International Journal of Computer Sciences and Engineering, 4(5), 180-184.

BibTex Style Citation:
@article{Babu_2016,
author = {C.Mallikarjuna, P.Chitti Babu},
title = {Performance Analysis of Disk Scheduling Algorithms},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2016},
volume = {4},
Issue = {5},
month = {5},
year = {2016},
issn = {2347-2693},
pages = {180-184},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=950},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=950
TI - Performance Analysis of Disk Scheduling Algorithms
T2 - International Journal of Computer Sciences and Engineering
AU - C.Mallikarjuna, P.Chitti Babu
PY - 2016
DA - 2016/05/31
PB - IJCSE, Indore, INDIA
SP - 180-184
IS - 5
VL - 4
SN - 2347-2693
ER -

VIEWS PDF XML
1499 1440 downloads 1386 downloads
  
  
           

Abstract

This paper aims to make performance analysis of various disk scheduling algorithms based on various factors. In these disks scheduling algorithms we consider First Come First Serve (FCFS), Shortest Seek Time First (SSTF), Scan, Look, C-Scan, and C-Look Scheduling Algorithms. Based on head movements of various disk scheduling algorithms we made performance analysis. These head movements are calculated for different disk scheduling algorithms while serving disk requests. Here we consider the performance factors such as access time, Disk throughput, Disk Utilization etc.

Key-Words / Index Term

Disk scheduling,Seek Time,Disk throughput,Disk utilization

References

[1]. William Stallings, “Operating Systems Internals and Design Principles”, Pearson Education, Sixth (6th) Edition , ISBN: 97881317 2528-3.
[2]. Elmasri, Carrick, “Operating System –A Spiral Approach”, Tata McGraw-Hill Education, First Edition, ISBN NO: 9780071070942, Page No: 302-314.
[3]. Silberchatz, Peter B.Galvin, Greg Gange,”Operating systems Principles”, Willey Edition, Eighth(8th) Edition, ISBN:978812650962-1, Page No:440-444.
[4] C.Mallikarjuna, P.Chitti Babu,” Priority Based Disk Scheduling Algorithm”, International Journal of Innovative Research in Science, Engineering and Technology, Vol.3, Issue 9, Page No:15954 -15959, Sept2014.
[5]. Andrew S Tanenbaum, “Modern Operating System”, Tata McGraw-Hill Education, Second(2nd) edition, ISBN:97880074635513,Page No:318-321.
[6]. Charles Crowley,” Operating System-A Design Oriented Approach”, Tata McGraw-Hill Education, Fifth (5Th) Edition, ISBN: 978074635513, Page No: 622-634.