Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home ยป Design and Implementation of Semi-preemptible IO
Tweet

connect with us

Design and Implementation of Semi-preemptible IO

Abstract: 

Allowing higher-priority requests to preempt ongoing disk IOs is of particular benefit to delay-sensitive multimedia and real-time systems. In this paper we propose Semi-preemptible IO, which divides an IO request into small temporal units of disk commands to enable preemptible disk access. We present main design strategies to allow preemption of each component of a disk access--seek, rotation, and data transfer. We analyze the performance and describe implementation challenges. Our evaluation shows that Semi-preemptible IO can substantially reduce IO waiting time with little loss in disk throughput. For example, expected waiting time for disk IOs in a video streaming system is reduced 2.1 times with the throughput loss of less than 6 percent.

Zoran Dimitrijevic, University of California, Santa Barbara

Raju Rangaswami, University of California, Santa Barbara

BibTeX
@inproceedings {270362,
author = {Zoran Dimitrijevic and Raju Rangaswami},
title = {Design and Implementation of Semi-preemptible {IO}},
booktitle = {2nd USENIX Conference on File and Storage Technologies (FAST 03)},
year = {2003},
address = {San Francisco, CA},
url = {https://www.usenix.org/conference/fast-03/design-and-implementation-semi-preemptible-io},
publisher = {USENIX Association},
month = mar,
}
Download

Links

Paper: 
http://www.usenix.org/events/fast03/tech/full_papers/dimitrijevic/dimitrijevic.pdf
Paper (HTML): 
http://www.usenix.org/events/fast03/tech/full_papers/dimitrijevic/dimitrijevic_html/index.html
  • Log in or    Register to post comments

© USENIX

  • Privacy Policy
  • Contact Us