IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 2- Issue 1, January 2013 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



A New Heuristic Disk Scheduling Algorithm

[Full Text]

 

AUTHOR(S)

Sandipon Saha, Md. Nasim Akhter, Mohammod Abul Kashem

 

KEYWORDS

Key words: Disk scheduling, SSTF, C-LOOK, SCAN, FCFS, C-SCAN, LOOK, HEAD MOVEMENT

 

ABSTRACT

Abstract:- Since the invention of the movable head disk, people have improved I/O performance by intelligent scheduling of disk accesses. Processor speed and memory capacity are increasing several times faster than disk speed. This disparity suggests that disk I/O performance will become an important bottleneck .Methods are needed for using disks more efficiently. Past analysis of disk scheduling algorithms has largely been experimental and little attempt has been made to develop algorithms with provable performance guarantees. Disk performance management is an increasingly important aspect of operating system research and development. In this paper a new disk scheduling algorithm has been proposed to reduce the number of movement of head. It is observed that in existing scheduling algorithms the number of head movement is high. But we proposed a new real-time disk scheduling algorithm that reduces the head movement therefore it maximizes throughput for modern storage devices.

 

REFERENCES

[1] Operating System Principles (6th edition) Abraham Silberschatz, Peter Bare Galvin, Greg Gagne

[2] Mordern operating system (2nd edition) Andrew S. Tanenbaum .

[3] Operating Systems: A Concept-based Approach(2E) D.M. Dhamdhere

[4] Intel, And Seagate. Serial Ata native command queuing july 2003.

[5] Kumar, R. Fairness in disk scheduling. Master thesis, Indian Institute of science, Bangladesh, India, Jan. 1993.

[6] SCSI architecture model-3(SAM3).Tech. Rep. T10 project 1561-D ,revision 14,International for information Committee Technology standards (INCITS),T10 Technical Committee. Sept. 2004.

[7] Chang, R., Shih, W., And Chnag, R. Real-time disk scheduling for multimedia application with deadline-modification-scan scheme. International Journal of Time-critical Computing System 19(2000),149-168.

[8] Dees, B. Native Command queuing-advanced performance in desktop storage. Potentials, IEEE 24, 4(2005),4-7.

[9] Frank, H .Analysis and optimization of disk storage devices for Time-sharing system. J ACM 16, 4(1969),602-620.

[10] Huang, Y., And Huang, J. Disk scheduling on multimedia storage servers. Computers, IEEE Transactions on 53, 1(2004), 77-82.

[11] Reddy,A.L.N.,And Wyllie,J. Disk Scheduling in a multimedia I/O system. ACM, pp.225-223.

[12] Ruemmler, C., And wiklkes,J. An introduction to disk drive modeling. Computer 27, 3(1994),17-28.

[13] C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27(3):1729, March 1994.

[14] Seaman, P.H., Lind, R. A., And Wilson, T. L. An analysis of auxiliary-storage activity. IBM System Journal 5, 3(1996), 158-170.

[15] Seltzer, M., Chen, P., And Ousterhout, J. Disk scheduling revisited, Jan . 1990.

[16] Yu, Y . J.,Shin, D. I., Eom, H., And Yeom , H. y. NCQ vs.I/O scheduler: Preventing unexpected misbehaviors. Trans. Storage 6, (2010), 1-37.

[17] Zhu, Y. Evolution of scheduling algorithms for real-time disk I/O. Tech.rep., Department of computer science and Engineering, University of Nebraska, May 2002.

[18] Reddy, A.L.N., Wyllie, J., and Wijyaratne, K.B.R. disk scheduling in a multimedia I/O system. ACM Trans. Multimedia Comput. Commun. Appl. 1, 1(2005), 37-59.

[19] Mesnier, M. P.,Wachs, M., Sambasivan, R.R. , Zheng, A.X., And Ganger, G .R . Modeling the relative fitness of storage. Sigmetrics Perform. Eval. Rev. 35, 1(2007),37