Metadata Update Performance in File Systems

Metadata Update Performance in File Systems (1994)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gregory R. Ganger , Yale N. Patt

Venue:	In Proceedings of the 1st Symposium on Operating Systems Design and Implementation (OSDI ’94
Citations:	89 - 12 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Metadata Update Performance in File Systems	SVM HeaderParse 0.2
AUTHOR NAME	Gregory R. Ganger	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of EECS, University of Michigan	SVM HeaderParse 0.2
AUTHOR NAME	Yale N. Patt	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of EECS, University of Michigan	SVM HeaderParse 0.2
ABSTRACT	Structural changes, such as file creation and block allocation, have consistently been identified as file system performance problems in many user environments. We compare several implementations that maintain metadata integrity in the event of a system failure but do not require changes to the on-disk structures. In one set of schemes, the file system uses asynchronous writes and passes ordering requirements to the disk scheduler. These schedulerenforced ordering schemes outperform the conventional approach (synchronous writes) by more than 30 percent for metadata update intensive benchmarks, but are suboptimal mainly due to their inability to safely use delayed writes when ordering is required. We therefore introduce soft updates, an implementation that asymptotically approaches memory-based file system performance (within 5 percent) while providing stronger integrity and security guarantees than most UNIX file systems. For metadata update intensive benchmarks, this improves performance by more than a factor of two when compared to the conventional approach. 1	SVM HeaderParse 0.2
YEAR	1994	INFERENCE
VENUE	In Proceedings of the 1st Symposium on Operating Systems Design and Implementation (OSDI ’94	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	49--60	INFERENCE
CITATIONS	23 found	ParsCit 1.0