Coda (file system)

From Wikipedia, the free encyclopedia

Coda
Developer	Carnegie Mellon University
Full name
Introduced	1987 ()
Partition identifier
Structures
Directory contents
File allocation
Bad blocks
Limits
Max file size
Max number of files
Max filename length
Max volume size
Allowed characters in filenames
Features
Dates recorded
Date range
Date resolution
Forks
Attributes
File system permissions
Transparent compression
Transparent encryption
Supported operating systems	Linux, NetBSD FreeBSD

Coda is a network file system developed as a research project at Carnegie Mellon University since 1987 under the direction of Mahadev Satyanarayanan. It descended directly from an older version of AFS (AFS-2) and offers many similar features. The InterMezzo file system was inspired by Coda. Coda is still under development, though the focus has shifted from research to creating a robust product for commercial use.

[edit] Features

Coda has many features that are desirable for network file systems, and several features not found elsewhere.

disconnected operation for mobile computing
is freely available under a liberal license
high performance through client side persistent caching
server replication
security model for authentication, encryption and access control
continued operation during partial network failures in server network
network bandwidth adaptation
good scalability
well defined semantics of sharing, even in the presence of network failures

Coda uses a local cache to provide access to server data when the network connection is lost. During normal operation, a user reads and writes to the file system normally, while the client fetches, or "hoards", all of the data the user has listed as important in the event of network disconnection. If the network connection is lost, the Coda client's local cache serves data from this cache and logs all updates. This operating state is called disconnected operation. Upon network reconnection, the client moves to reintegration state; it sends logged updates to the servers. Then it transitions back to normal connected-mode operation.

Also different from AFS is Coda's data replication method. AFS uses a pessimistic replication strategy with its files, only allowing one read/write server to receive updates and all other servers acting as read-only replicas. Coda allows all servers to receive updates, allowing for a greater availability of server data in the event of network partitions, a case which AFS cannot handle.

These unique features introduce the possibility of semantically diverging copies of the same files or directories, known as "conflicts". Disconnected operation's local updates can potentially clash with other connected users' updates on the same objects, preventing reintegration. Optimistic replication can potentially cause concurrent updates to different servers on the same object, preventing replication. The former case is called a "local/global" conflict, and the latter case a "server/server" conflict. Coda has extensive repair tools, both manual and automated, to handle and repair both types of conflicts.