- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Disk Scheduler Circular Shortest Seek-Time First C-SSTF | ||
| Baghdad College of Economic sciences University | ||
| Article 1, Volume 0, Issue 14, 2018, Pages 427-445 | ||
| Author | ||
| AHMED MHMED MAL-ALLAH AL-SAFAR | ||
| Abstract | ||
| Developments in processor speed and memory capacity subsequently need substantial improving in disk scheduling algorithms to reduce the disparity in performance between them. The basic idea behind this novel algorithm is to give the disk I/O request improving performance by new intelligent scheduler of disk accessing so that optimizing head movement to guarantee fairness in response time and treat all I/O requests equally. The research depended on the scope of well-known criteria for evaluating the performance of this algorithm design of disk I/O request to ensure gaining the optimal algorithm among all other. | ||
| Keywords | ||
| First; Come; First Served Scheduling; Shortest Seek; Time First; SCAN; Circular SCAN | ||
|
Statistics Article View: 96 PDF Download: 31 |
||