Fairness of proportional work-conserving I/O scheduling

Seehwan Yoo; Chuck Yoo; Hyunchan Park

doi:10.1049/el.2012.0261

Fairness of proportional work-conserving I/O scheduling

Seehwan Yoo^*
, Chuck Yoo
, Hyunchan Park

^*Corresponding author for this work

Department of Computer Science & Artificial Intelligence

Korea University

Research output: Contribution to journal › Journal article › peer-review

2 Scopus citations

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	https://doi.org/10.1049/el.2012.0261
State	Published - 2012.06.7

Access to Document

10.1049/el.2012.0261

Cite this

@article{9d87255ee0ae45b986fbd0854257fdf8,

title = "Fairness of proportional work-conserving I/O scheduling",

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.",

author = "Seehwan Yoo and Chuck Yoo and Hyunchan Park",

year = "2012",

month = jun,

day = "7",

doi = "10.1049/el.2012.0261",

language = "English",

volume = "48",

pages = "682--684",

journal = "Electronics Letters",

issn = "0013-5194",

number = "12",

}

TY - JOUR

T1 - Fairness of proportional work-conserving I/O scheduling

AU - Yoo, Seehwan

AU - Yoo, Chuck

AU - Park, Hyunchan

PY - 2012/6/7

Y1 - 2012/6/7

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84864268633

U2 - 10.1049/el.2012.0261

DO - 10.1049/el.2012.0261

M3 - Journal article

AN - SCOPUS:84864268633

SN - 0013-5194

VL - 48

SP - 682

EP - 684

JO - Electronics Letters

JF - Electronics Letters

IS - 12

ER -

Fairness of proportional work-conserving I/O scheduling

Abstract

Access to Document

Other files and links

Fingerprint

Cite this