CA-NFS: A Congestion-Aware Network File System
Date
March 01, 2009
Author
Alexandros Batsakis, Randal Burns, Arkady Kanevsky, James Lentini, and Thomas Talpey.
This paper presents a holistic framework for adaptively scheduling asynchronous requests in distributed file systems.
We develop a holistic framework for adaptively scheduling asynchronous requests in distributed file systems. The system is holistic in that it manages all resources, including network bandwidth, server I/O, server CPU, and client and server memory utilization. It accelerates, defers, or cancels asynchronous requests in order to improve application-perceived performance directly. We employ congestion pricing via online auctions to coordinate the use of system resources by the file system clients so that they can detect shortages and adapt their resource usage. We implement our modifications in the Congestion-Aware Network File System (CA-NFS), an extension to the ubiquitous network file system (NFS). Our experimental result shows that CA-NFS results in a 20% improvement in execution times when compared with NFS for a variety of workloads.
Best Paper Award
In Proceedings of the USENIX Conference on File and Storage Technologies 2009 (FAST '09)
Resources
A copy of the paper is attached to this posting. A version of the paper was also published in ACM Transactions on Storage (TOS), Vol. 5, No. 4, 2009, Article No. 15. It can be found at: https://dl.acm.org/citation.cfm?doid=1629080.1629085.
