Show simple item record

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.identifier.issn1300-0632
dc.identifier.urihttp://hdl.handle.net/11693/49473
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.language.isoEnglishen_US
dc.source.titleTurkish Journal of Electrical Engineering & Computer Sciencesen_US
dc.relation.isversionofhttps://doi.org/10.3906/elk-1610-271en_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
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage3367en_US
dc.citation.epage3380en_US
dc.citation.volumeNumber25en_US
dc.citation.issueNumber4
dc.identifier.doi10.3906/elk-1610-271en_US
dc.publisherTÜBITAKen_US
dc.contributor.bilkentauthorAkar, Nail
dc.identifier.eissn1303-6203


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record