Measurements of a distributed file system
Authors:
Open Access
- 1 September 1991
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 25 (5) , 198-212
Abstract
We analyzed the user-level file access patterns and caching behavior of the Sprite distributed file system. The first part of our analysis repeated a study done in 1985 of the: BSD UNIX file system. We found that file throughput has increased by a factor of 20 to an average of 8 Kbytes per second per active user over 10-minute intervals, and that the use of process migration for load sharing increased burst rates by another factor of six. Also, many more very large (multi-megabyte) files are in use today than in 1985. The second part of our analysis measured the behavior of Sprite's main-memory file caches. Client-level caches average about 7 Mbytes in size (about one-quarter to one-third of main memory) and filter out about 50% of the traffic between clients and servers. 35% of the remaining server traffic is caused by paging, even on workstations with large memories. We found that client cache consistency is needed to prevent stale data errors, but that it is not invoked often enough to degrade overall system performance.Keywords
This publication has 8 references indexed in Scilit:
- The design and implementation of a log-structured file system1991
- Transparent process migration: Design alternatives and the sprite implementationSoftware: Practice and Experience, 1991
- Amoeba: a distributed operating system for the 1990sComputer, 1990
- Scale and performance in a distributed file systemACM Transactions on Computer Systems, 1988
- Caching in the Sprite network file systemACM Transactions on Computer Systems, 1988
- The Sprite network operating systemComputer, 1988
- A trace-driven analysis of the UNIX 4.2 BSD file system1985
- The V Kernel: A Software Base for Distributed SystemsIEEE Software, 1984