Disk Scheduling Algorithms

Simple item page
dc.contributor.authorPariyar, Subash
dc.date.accessioned2021-11-26T09:08:17Z
dc.date.available2021-11-26T09:08:17Z
dc.date.issued2008
dc.description.abstractWithout I/O, computers are not usable to users. We know that I/O from secondary memories like disk is slower operations. Scheduling of I/O requests such that response time of requests and become as possible as low and also requests does not suffer from the problem of a starvation is big issue in our computer systems. In this project simulates a disk having 200 tracks, implements different existing disk scheduling algorithms for that simulated disk and seek time of these algorithms for given I/O request set is compared and analyzed.en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14540/6149
dc.language.isoen_USen_US
dc.publisherCentral Department of Computer Science and Information Technologyen_US
dc.subjectcomputer systemsen_US
dc.subjectimplements different existing disken_US
dc.titleDisk Scheduling Algorithmsen_US
dc.typeThesisen_US
local.academic.levelMastersen_US
local.institute.titleCentral Department of Computer Science and Information Technologyen_US
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
Cover Page(8).pdf
Size:
27.65 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
Chapter Page(1).pdf
Size:
414 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science & Information Technology