Disk scheduling with shortest cumulative access time first algorithms

Simple item page
buir.contributor.authorAkar, Nail
dc.citation.epage3380en_US
dc.citation.issueNumber4
dc.citation.spage3367en_US
dc.citation.volumeNumber25en_US
dc.contributor.authorAkar, Nailen_US
dc.contributor.authorTunç, Ç.en_US
dc.contributor.authorGaertner, M.en_US
dc.contributor.authorErden, F.en_US
dc.date.accessioned2019-02-13T16:49:35Z
dc.date.available2019-02-13T16:49:35Z
dc.date.issued2017en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractA new class of scheduling algorithms is proposed for disk drive scheduling. As opposed to choosing the request with the shortest access time in conventional shortest access time first (SATF) algorithms, we choose an ordered sequence of pending I/O requests at the scheduling instant with the shortest cumulative access time. Additionally, we introduce flexibility for forthcoming requests to alter the chosen sequence. Simulation results are provided to validate the effectiveness of the proposed disk scheduler. Throughput gains of 3% and above are shown to be attainable, although this occurs at the expense of increased computational complexity.en_US
dc.description.provenanceSubmitted by Şelale Korkut (selale@bilkent.edu.tr) on 2019-02-13T16:49:34Z No. of bitstreams: 1 Disk_scheduling_with_shortest_cumulative_access_time_first_algorithms.pdf: 624428 bytes, checksum: de2a9bc5d34582ee54510e0edc35fef7 (MD5)en
dc.description.provenanceMade available in DSpace on 2019-02-13T16:49:35Z (GMT). No. of bitstreams: 1 Disk_scheduling_with_shortest_cumulative_access_time_first_algorithms.pdf: 624428 bytes, checksum: de2a9bc5d34582ee54510e0edc35fef7 (MD5) Previous issue date: 2017en
dc.identifier.doi10.3906/elk-1610-271en_US
dc.identifier.eissn1303-6203
dc.identifier.issn1300-0632
dc.identifier.urihttp://hdl.handle.net/11693/49473
dc.language.isoEnglishen_US
dc.publisherTÜBITAKen_US
dc.relation.isversionofhttps://doi.org/10.3906/elk-1610-271en_US
dc.source.titleTurkish Journal of Electrical Engineering & Computer Sciencesen_US
dc.subjectDisk schedulingen_US
dc.subjectShortest access time firsten_US
dc.subjectSequential request processingen_US
dc.titleDisk scheduling with shortest cumulative access time first algorithmsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Disk_scheduling_with_shortest_cumulative_access_time_first_algorithms.pdf
Size:
609.79 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
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

Scholarly Publications - Electrical and Electronics Engineering