Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 원유집 | - |
dc.date.accessioned | 2018-05-02T05:29:38Z | - |
dc.date.available | 2018-05-02T05:29:38Z | - |
dc.date.issued | 2014-03 | - |
dc.identifier.citation | SCIENTIFIC WORLD JOURNAL, 2014, 940850 | en_US |
dc.identifier.issn | 1537-744X | - |
dc.identifier.uri | https://www.hindawi.com/journals/tswj/2014/940850/ | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/71219 | - |
dc.description.abstract | In heterogeneous I/O workload environments, disk scheduling algorithms should support different QoS (Quality-of-Service) for each I/O request. For example, the algorithm should meet the deadlines of real-time requests and at the same time provide reasonable response time for best-effort requests. This paper presents a novel disk scheduling algorithm called G-SCAN(Grouping-SCAN) for handling heterogeneous I/O workloads. To find a schedule that satisfies the deadline constraints and seek time minimization simultaneously, G-SCAN maintains a series of candidate schedules and expands the schedules whenever a new request arrives. Maintaining these candidate schedules requires excessive spatial and temporal overhead, but G-SCAN reduces the overhead to a manageable level via pruning the state space using two heuristics. One is grouping that clusters adjacent best-effort requests into a single scheduling unit and the other is the branch-and-bound strategy that cuts off inefficient or impractical schedules. Experiments with various synthetic and real-world I/O workloads show that G-SCAN outperforms existing disk scheduling algorithms significantly in terms of the average response time, throughput, and QoS-guarantees for heterogeneous I/O workloads. We also show that the overhead of G-SCAN is reasonable for on-line execution. | en_US |
dc.description.sponsorship | This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (no. 2012-0001924 and no. 2011-0028825). The present research has been also conducted by the Research Grant of Kwangwoon University in 2013. | en_US |
dc.language.iso | en | en_US |
dc.publisher | HINDAWI Publishing Corpration | en_US |
dc.title | A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads | en_US |
dc.title.alternative | O Workloads | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1155/2014/940850 | - |
dc.relation.page | 1-17 | - |
dc.relation.journal | SCIENTIFIC WORLD JOURNAL | - |
dc.contributor.googleauthor | Kim, Tae-seok | - |
dc.contributor.googleauthor | Bahn, Hyo-kyung | - |
dc.contributor.googleauthor | Won, You-jip | - |
dc.relation.code | 2014039259 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF COMPUTER SCIENCE | - |
dc.identifier.pid | yjwon | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.