Loading...
Please wait, while we are loading the content...
Similar Documents
2TL: A raid I/O scheduling algorithm for simultaneously providing latency and throughput guarantees
| Content Provider | Semantic Scholar |
|---|---|
| Author | Kwok, Yipkei |
| Copyright Year | 2014 |
| Abstract | It is increasingly common for applications to require that data read from and written to a shared storage system be delivered within a specified amount of time (usually milliseconds), called a latency requirement, or be delivered at a specified rate (measured in megabytes per second), called a throughput requirement. Given an input/output (I/O) workload, which consists of the streams of I/O requests of a set of applications, the storage system, via its I/O scheduler, is expected to simultaneously meet the workload’s latency and throughput requirements. In addition, it is expected to provide performance guarantees, i.e., guarantees that it will meet a workload’s latency and throughput requirements. Of course, these guarantees are provided under certain conditions associated with the storage system and the streams in the workload. While providing throughput guarantees is a well-studied topic, providing latency guarantees requires further study. The vast majority of the existing schedulers that provide latency guarantees are “reactive” schedulers, which adjust request scheduling parameters based on stream performance. That is, when the latency requirement of a stream is not being met, a reactive scheduler adjusts its scheduling parameters, which may include increasing the service allocated to the stream, to meet the stream’s latency requirement. The reactive nature of these schedulers makes it difficult, if not impossible, for them to meet latency requirements at high percentiles, e.g., for 99% of requests, to meet the latency requirement, for streams with bursty access characteristics. This dissertation introduces TL, an I/O scheduler for RAID storage systems that simultaneously provides latency guarantees at high percentiles as well as throughput guarantees. TL was designed and implemented to continuously monitor the access characteristics of the latency-bound streams in a given workload and proactively adjust its scheduling parameters to meet their latency requirements. To the best of our knowledge, TL is only the second scheduler in the literature that employs proactive scheduling to meet latency requirements |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=2276&context=open_etd |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
