Abstract
Proposed is a new I/O scheduling for SSD, proportional work-conserving. The proposed scheduling algorithm provides proportional fairness among tasks. To provide proportional fairness, proportional work-conserving differentiates probability to fully utilise the task's quantum, which is controlled by adjusting opportunistic waiting time. Its proportional fairness is formally proveds and its validity through numerical evaluation and experimental results from Linux implementation are presented.
| Original language | English |
|---|---|
| Pages (from-to) | 682-684 |
| Number of pages | 3 |
| Journal | Electronics Letters |
| Volume | 48 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 2012 Jun 7 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'Fairness of proportional work-conserving I/O scheduling'. Together they form a unique fingerprint.
Cite this
Yoo, S., Yoo, C., & Park, H. (2012). Fairness of proportional work-conserving I/O scheduling. Electronics Letters, 48(12), 682-684. https://doi.org/10.1049/el.2012.0261