Issues in the design and use of a distributed file system
Authors:
Open Access
- 1 July 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 14 (3) , 55-69
Abstract
This paper discusses an independent file facility, one that is not embedded in an operating system. The distributed file system (DFS) is so named because it is implemented on a cooperating set of server computers connected by a communications, network, which together create the illusion of a single, logical system for the creation, deletion, and random accessing of data. Access to the DFS can only be accomplished over the network; a computer (or, more precisely, a program running on one) that uses the DFS is called a client . This paper describes the division of responsibility between servers and clients. The basic tool for maintaining data consistency in these situations is the atomic property of transactions, which protects clients from system malfunctions and from the competing activities of other clients. Several cooperating clients may share a transaction. The DFS provides an unconventional locking mechanism between transactions that supports client caches and eliminates a novel form of deadly embrace. We have implemented and put into service a system based on these concepts.Keywords
This publication has 4 references indexed in Scilit:
- Weighted voting for replicated data1979
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- EthernetCommunications of the ACM, 1976
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972