CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Simple Sequence Oriented Disk (SSOD) Scheduling Algorithm

by Monu Kumar, Mukul Panwar, Sanjay Bhargava
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 100 - Number 2
Year of Publication: 2014
Authors: Monu Kumar, Mukul Panwar, Sanjay Bhargava
10.5120/17497-8029

Monu Kumar, Mukul Panwar, Sanjay Bhargava . Simple Sequence Oriented Disk (SSOD) Scheduling Algorithm. International Journal of Computer Applications. 100, 2 ( August 2014), 20-24. DOI=10.5120/17497-8029

@article{ 10.5120/17497-8029,
author = { Monu Kumar, Mukul Panwar, Sanjay Bhargava },
title = { Simple Sequence Oriented Disk (SSOD) Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 100 },
number = { 2 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 20-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume100/number2/17497-8029/ },
doi = { 10.5120/17497-8029 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:28:53.298556+05:30
%A Monu Kumar
%A Mukul Panwar
%A Sanjay Bhargava
%T Simple Sequence Oriented Disk (SSOD) Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 100
%N 2
%P 20-24
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

As the hard-disk technology has been improved considerably. A significant amount of work also has been done to reduce the seek time of the disk. With the increased speed of processor, faster RAM compatible disk scheduling algorithms had been proposed and some of them are really implemented. The main focus of most of the proposed algorithms is to reduce head movement. In this paper a new disk scheduling algorithm has been proposed ie. Simple Sequence Oriented Disk Scheduling Algorithm (SSOD) which significantly reduces the head movement when compared to some famous already existing disk scheduling algorithms.

References
  1. C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE computer, 27(3):17–29, March 1994.
  2. Lee, S. hyun. & Kim Mi Na, (2008) "This is my paper", ABC Transactions on ECE, Vol. 10, No. 5, pp120-122
  3. R. Muthu Selvi and R. Rjaram, a Genetic Based Approach for Multi- Objective Optimization of Disk Scheduling to reduce completion time and Missed Task (Vol,1 No. 4, August 2011).
  4. Gary J. Nutt, Operating System-A modern perspective(second edition).
  5. Willian Stallings, Operating system(Second Edition, fifth edition).
  6. Operating System Principles (6th edition) Abraham Silberschatz, Peter Bare Galvin, Greg Gagne.
  7. A New Heuristic Disk Scheduling Algorithm Sandipon Saha, Md. Nasim Akhter, Mohammod AbulKashem IJSTR RESARCH VOLUME 2 ISSUE1,JANUARY 2013 ISSN 2277-8616
  9. . Denning, P. J. (1967) "Effects of scheduling on file memory operations", AFIPS Joint Computer Conferences, pp9-21.
  10. Geist, R & Daniel, S, (1987) "A continuum of disk scheduling algorithms", ACM Transactions on Computing Systems, Vol. 5, No. 1, pp77-92.
  11. Chen, S. , Stankovic, J. A. , Kurose, J. F. and Towsley, D, (1991) "Performance evaluation of two new disk scheduling algorithms for real-time systems", Journal of Real-Time System, Vol. 3, No. 3, pp307-336.
  12. Seltzer, M. , Chen, P. and Ousterhout, J, (1990) "Disk scheduling revisited", USENIX Tech Conference, pp313-324.
  13. Hofri, M, (1980) "Disk scheduling: FCFS vs. SSTF revisited", Communications of the ACM, Vol. 23, No. 11, pp645-653.
  14. Chen, T. S. , Yang, W. P. and Lee, R. C. T, (1992) "Amortized analysis of some disk scheduling algorithms: SSTF, SCAN and N-Step SCAN", BIT 32, pp546-558.
  15. Worthington, B. L. , Ganger, G. R. and Patt, Y. N, (1994) "Scheduling algorithms for modern disk drives", Proceedings of ACM SIGMETRICS Conference, pp241-251.
  16. Coffman, E. G. and Hofri, M, (1982) "On the expected performance of scanning disks", SIAM Journal on Computing, Vol. 11, No. 1, pp60-70.
  17. Coffman, E. G, (1973) "A note on the relative performance of two disk scanning policies", Information Processing Letters, Vol. 2, No. 1, pp15 17.
  18. Sohn, J. M. and Kim, G. Y, (1997) "Earliest-deadline-first scheduling on non-preemptive real-time threads for continuous media server", Proceedings of HPCN, Vol. 1225, pp950-956.
  19. http://airccse. org/journal/ijitcs/papers/0811ijitcs07. pdf
  20. http://wenku. baidu. com/view/e9bebee90975f46527d3e134.
  21. http://www. ijstr/final-print/jan2013/A-New-Heuristic-Disk-Scheduling-Algorithm. pdf.
Index Terms

Computer Science
Information Sciences

Keywords

Disk scheduling SSTF C-LOOK SCAN FCFS C-SCAN LOOK HEAD MOVEMENT RQ (Request Queue)

Powered by PhDFocusTM