Pre-Reset the R/W Head to Zero Track in SCAN and C-SCAN Disk Scheduling Algorithm
Keywords:SCAN, C-SCAN, Scheduler, algorithm, Seek-Time, increasing throughput, response time
According to a high gap between the bounded developments in disk scheduling algorithms in contrast to processor speed and memory capacity developments, so successive improving disk scheduling algorithms is almost needed to reduce the overall time consuming of system performance.
To enhance both traditional SCAN and C-SCAN algorithms is the goal of this research, so, rather than the best Seek-Time obtained from traditional (SCAN and C-SCAN) algorithms, the idea behind this proposal "Pre-Reset the R/W Head to Zero Track in SCAN and C-SCAN Disk Scheduling Algorithm" is to enhance the traditional algorithms and gaining the optimal performance time by having the optimal Seek-Time.
It is worthily mentioned that the evaluation of the performance of the new strategy in this algorithm was tested by scientific criteria to ensure gaining the optimal algorithm compering with the traditional strategy.
Journal of Advanced Computer Science and Technology Research, Vol.4 No.2, June 2014, 40-49.
 James L. Peterson & Abraham Silberschatz, " Operating System Concepts ", Second Edition, University of Texas at Austin, Addison-Wesley, Inc. Copyright © 1985.
 A. M. Lister, " Fundamentals Of Operating Systems ", Third Edition, University of Queensland, Higher and Further Education Division, Copyright © 1984.
 DAVID BARRON, Professor of Computer Studies, University of Southampton, "Computer Operating Systems For micros, minis and mainframes", Second Edition, USA by Chapman and Hall, Copyright © 1984.
 Avi Silberschatz, Peter Baer Galvin, Greg Gagne, "Operating System Concepts Essentials", Ninth Edition, John Wiley & Sons, Inc, ISBN 978-1-118-06333-0, © December, 7- 2012.
A ▪ http://www2.cs.uregina.ca/~hamilton/courses/330/notes/io/node7.html
B ▪ http://www.eecs.harvard.edu/margo/papers/usenix90