Efficient Guaranteed Disk Request Scheduling with Fahrrad

Efficient Guaranteed Disk Request Scheduling with Fahrrad (2008)

Cached

Download Links

[ssrc.cse.ucsc.edu]
[www.tmwong.org]

Other Repositories/Bibliography

DBLP

by Anna Povzner , Tim Kaldewey , Scott Brandt , Richard Golding , Theodore M. Wong , Carlos Maltzahn

Venue:	IN EUROSYS
Citations:	13 - 4 self

Versions

Version History

Metadata Version 3

User correction supplied by mph

Datum	Value	Source
TITLE	Efficient Guaranteed Disk Request Scheduling with Fahrrad	INFERENCE
AUTHOR NAME	Anna Povzner	user correction
AUTHOR AFFIL	Computer Science Department, University of California, Santa Cruz; †IBM Almaden Research Center, San Jose	user correction
AUTHOR ADDR	CA	user correction
AUTHOR NAME	Tim Kaldewey	user correction
AUTHOR AFFIL	Computer Science Department, University of California, Santa Cruz; †IBM Almaden Research Center, San Jose	user correction
AUTHOR ADDR	CA	user correction
AUTHOR NAME	Scott Brandt	user correction
AUTHOR AFFIL	Computer Science Department, University of California, Santa Cruz; †IBM Almaden Research Center, San Jose	user correction
AUTHOR ADDR	CA	user correction
AUTHOR NAME	Richard Golding	user correction
AUTHOR AFFIL	Computer Science Department, University of California, Santa Cruz; †IBM Almaden Research Center, San Jose	user correction
AUTHOR ADDR	CA	user correction
AUTHOR NAME	Theodore M. Wong	user correction
AUTHOR AFFIL	Computer Science Department, University of California, Santa Cruz; †IBM Almaden Research Center, San Jose	user correction
AUTHOR ADDR	CA	user correction
AUTHOR NAME	Carlos Maltzahn	user correction
AUTHOR AFFIL	Computer Science Department, University of California, Santa Cruz; †IBM Almaden Research Center, San Jose	user correction
AUTHOR ADDR	CA	user correction
ABSTRACT	Guaranteed I/O performance is needed for a variety of applications ranging from real-time data collection to desktop multimedia to large-scale scientific simulations. Reservations on throughput, the standard measure of disk performance, fail to effectively manage disk performance due to the orders of magnitude difference between best-, average-, and worst-case response times, allowing reservation of less than 0.01 % of the achievable bandwidth. We show that by reserving disk resources in terms of utilization it is possible to create a disk scheduler that supports reservation of nearly 100 % of the disk resources, provides arbitrarily hard or soft guarantees depending upon application needs, and yields efficiency as good or better than best-effort disk schedulers tuned for performance. We present the architecture of our scheduler, prove the correctness of its algorithms, and provide results demonstrating its effectiveness.	SVM HeaderParse 0.2
YEAR	2008	user correction
VENUE	IN EUROSYS	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	13--25	INFERENCE
CITATIONS	21 found	ParsCit 1.0