Fairness of proportional work-conserving I/O scheduling

Seehwan Yoo, Hyuck Yoo, Hyunchan Park

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)682-684
Number of pages3
JournalElectronics Letters
Volume48
Issue number12
DOIs
Publication statusPublished - 2012 Jun 7

Fingerprint

Scheduling algorithms
Scheduling
Linux

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Fairness of proportional work-conserving I/O scheduling. / Yoo, Seehwan; Yoo, Hyuck; Park, Hyunchan.

In: Electronics Letters, Vol. 48, No. 12, 07.06.2012, p. 682-684.

Research output: Contribution to journalArticle

Yoo, Seehwan ; Yoo, Hyuck ; Park, Hyunchan. / Fairness of proportional work-conserving I/O scheduling. In: Electronics Letters. 2012 ; Vol. 48, No. 12. pp. 682-684.
@article{60ccd3a157a140b2aec79f14af6e16af,
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 Hyuck Yoo and Hyunchan Park",
year = "2012",
month = "6",
day = "7",
doi = "10.1049/el.2012.0261",
language = "English",
volume = "48",
pages = "682--684",
journal = "Electronics Letters",
issn = "0013-5194",
publisher = "Institution of Engineering and Technology",
number = "12",

}

TY - JOUR

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

AU - Yoo, Seehwan

AU - Yoo, Hyuck

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 - http://www.scopus.com/inward/record.url?scp=84864268633&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864268633&partnerID=8YFLogxK

U2 - 10.1049/el.2012.0261

DO - 10.1049/el.2012.0261

M3 - Article

AN - SCOPUS:84864268633

VL - 48

SP - 682

EP - 684

JO - Electronics Letters

JF - Electronics Letters

SN - 0013-5194

IS - 12

ER -