Please use this identifier to cite or link to this item:
https://elibrary.tucl.edu.np/handle/123456789/6149Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Pariyar, Subash | - |
| dc.date.accessioned | 2021-11-26T09:08:17Z | - |
| dc.date.available | 2021-11-26T09:08:17Z | - |
| dc.date.issued | 2008 | - |
| dc.identifier.uri | https://elibrary.tucl.edu.np/handle/123456789/6149 | - |
| dc.description.abstract | Without 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.language.iso | en_US | en_US |
| dc.publisher | Central Department of Computer Science and Information Technology | en_US |
| dc.subject | computer systems | en_US |
| dc.subject | implements different existing disk | en_US |
| dc.title | Disk Scheduling Algorithms | en_US |
| dc.type | Thesis | en_US |
| local.institute.title | Central Department of Computer Science and Information Technology | en_US |
| local.academic.level | Masters | en_US |
| Appears in Collections: | Computer Science & Information Technology | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Cover Page(8).pdf | 27.65 kB | Adobe PDF | View/Open | |
| Chapter Page(1).pdf | 414 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.