Log-based directory resolution in the Coda file system

30 December 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 202-213
https://doi.org/10.1109/pdis.1993.253092

Abstract

A key problem in optimistic replication, namely, using semantic knowledge of objects to resolve concurrent updates from multiple partitions, is addressed. The authors describe how the Coda file system resolves partitioned updates to directories. The central result is that logging of updates is a simple yet efficient and powerful technique for directory resolution in Unix file systems. Measurements show that the time for resolution is typically less than 10% of the time for performing the original set of partitioned updates. Analysis based on file traces indicates that a log size of 2 MB per hour of partition should be ample for typical services.

Keywords

This publication has 7 references indexed in Scilit:

Disconnected operation in the Coda File System
ACM Transactions on Computer Systems, 1992
The influence of scale on distributed file system design
IEEE Transactions on Software Engineering, 1992
Scalable, secure, and highly available distributed file access
Computer, 1990
Coda: a highly available file system for a distributed workstation environment
IEEE Transactions on Computers, 1990
Parallel communication in a large distributed environment
IEEE Transactions on Computers, 1990
Consistency in a partitioned network: a survey
ACM Computing Surveys, 1985
The LOCUS distributed operating system
Published by Association for Computing Machinery (ACM) ,1983