Fairness of proportional work-conserving I/O scheduling

Access Full Text

Fairness of proportional work-conserving I/O scheduling

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

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.

Inspec keywords: scheduling; Linux; disc drives; probability; numerical analysis

Other keywords: numerical evaluation; solid-state drive; Linux implementation; SSD; opportunistic waiting time adjustment; probability; proportional work-conserving I/O scheduling fairness; scheduling algorithm

Subjects: Other topics in statistics; Memory circuits; Other topics in statistics; Semiconductor storage; Operating systems

References

    1. 1)
      • Agrawal, N., Prabhakaran, V., Wobber, T., Davis, J.D., Manasse, M., Panigrahy, R.: `Design tradeoffs for ssd performance', USENIX 2008 Annual Technical Conference, 2008, Berkeley, CA, USA, p. 57–70, USENIX Association.
    2. 2)
    3. 3)
      • Iyer, S., Druschel, P.: `Anticipatory scheduling: a disk scheduling framework to overcome deceptive idleness in synchronous i/o', Proc. of 18th ACM Symp. on Operating Systems Principles, ser. SOSP ’01, 2001, New York, NY, USA, p. 117–130, ACM.
    4. 4)
      • Kim, J., Oh, Y., Kim, E., Choi, J., Lee, D., Noh, S.H.: `Disk schedulers for solid state drivers', Proc. of seventh ACM conf. on Embedded software, ser. EMSOFT ’09, 2009, New York, NY, USA, p. 295–304, ACM.
    5. 5)
      • L. Mearian . Aol installs 50tb of ssd; boosts db performance by 4x.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2012.0261
Loading

Related content

content/journals/10.1049/el.2012.0261
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading