Abstract | ||
---|---|---|
Garbage collection (GC) and resource contention on I/O buses (channels) are among the critical bottlenecks in Solid State Disks (SSDs) that cannot be easily hidden. Most existing I/O scheduling algorithms in the host interface logic (HIL) of state-of-the-art SSDs are oblivious to such low-level performance bottlenecks in SSDs. As a result, SSDs may violate quality of service (QoS) requirements by not being able to meet the deadlines of I/O requests. In this paper, we propose a novel host interface I/O scheduler that is both GC-aware and QoS-aware. The proposed scheduler redistributes the GC overheads across non-critical I/O requests and reduces channel resource contention. Our experiments with workloads from various application domains reveal that the proposed scheduler reduces the standard deviation for latency over stateof- the-art I/O schedulers used in the HIL by 52.5%, and the worst-case latency by 86.6%. In addition, for I/O requests with sizes smaller than a superpage, our proposed scheduler avoids channel resource conflicts and reduces latency by 29.2% compared to the state-of-the-art
|
Year | DOI | Venue |
---|---|---|
2014 | 10.1109/ISCA.2014.6853216 | ISCA |
Keywords | Field | DocType |
computer interfaces,ssd,i/o scheduling algorithm,quality of service,storage management,solid state disks,channel resource contention,garbage collection,host interface logic,qos,hios,disc storage,host interface i/o scheduler,parallel processing,protocols,schedules | Deadline scheduler,I/O scheduling,Latency (engineering),Computer science,Scheduling (computing),Parallel computing,Quality of service,Input/output,Real-time computing,Schedule,Garbage collection,Operating system | Conference |
ISSN | ISBN | Citations |
1063-6897 | 978-1-4799-4394-4 | 17 |
PageRank | References | Authors |
0.72 | 17 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Myoung-Soo Jung | 1 | 314 | 25.09 |
Wonil Choi | 2 | 36 | 4.98 |
Shekhar Srikantaiah | 3 | 215 | 10.47 |
Joonhyuk Yoo | 4 | 33 | 4.18 |
Mahmut T. Kandemir | 5 | 7371 | 568.54 |