The evolution of Coda

@article{Satyanarayanan2002TheEO,
  title={The evolution of Coda},
  author={Mahadev Satyanarayanan},
  journal={ACM Trans. Comput. Syst.},
  year={2002},
  volume={20},
  pages={85-124}
}
Failure-resilient, scalable, and secure read-write access to shared information by mobile and static users over wireless and wired networks is a fundamental computing challenge. In this article, we describe how the Coda file system has evolved to meet this challenge through the development of mechanisms for server replication, disconnected operation, adaptive use of weak connectivity, isolation-only transactions, translucent caching, and opportunistic exploitation of hardware surrogates. For… Expand
Seamless Service Access via Resource Replication
TLDR
An archetypical architecture for mobile middleware is presented, the mechanisms supporting how and which data is replicated (both for the object and file models), the solution for the garbage collection of replicas, and the policies allowing applications to control objects replication are addressed. Expand
Storage Systems for Mobile Environment
TLDR
This chapter mainly focuses on CODA, a fully mobility transparent file system based on well known distributed file system AFS that introduced queued remote procedure calls (QRPC), optimistic replica management and prefetching (hoarding), and a light weight filtering file system layer sitting between VFS and a native file system. Expand
MFS: an Adaptive Distributed File System for Mobile Hosts
TLDR
It is shown how MFS is able to adapt to widely varying bandwidth levels through the use of modeless adaptation, and the benefit of mechanisms for improving file system performance and cache consistency using microbenchmarks and file system traces. Expand
Replicated Data Management for Mobile Computing
  • D. Terry
  • Computer Science
  • Replicated Data Management for Mobile Computing
  • 2008
TLDR
This lecture explores the choices faced in designing a replication protocol, with particular emphasis on meeting the needs of mobile applications, and presents the inherent trade-offs and implicit assumptions in alternative designs. Expand
Data Staging on Untrusted Surrogates
TLDR
A novel architecture, data staging, that improves the performance of distributed file systems running on small, storage-limited pervasive computing devices and reduces average file operation latency for interactive applications running on the Compaq iPAQ hand-held by up to 54%. Expand
Data Staging on Untrusted
TLDR
A novel architecture, data staging, that improves the performance of distributed systemsrunning on small, storage-limited pervasive com-puting devices by opportunistically caching data on nearby surrogate machines by redirecting cache misses to staged data on a nearbys surrogate while still maintaining the consistencyguarantees of the underlying system. Expand
Flexible on-device service object replication with replets
TLDR
The Replet system exploits on-device replication to enable client-, server- and application-specific cost metrics for replica invocation and synchronization, and demonstrates theviability and significant benefits of CPI-driven on- device serviceobject replication. Expand
Separating computation and storage with storage virtualization
TLDR
This paper argues that a centralized storage of software and data, while distributed computation in clients, i.e., transparent computing, can address challenges potentially and reduce the complexity with reduced software maintenance time, improved system availability, and enhanced security. Expand
Caching and Data Replication in Mobile Environment
Caching and replications are well known techniques for fast access of frequently used data. In a mobile distributed environment, these techniques assumes greater significance as mobile computersExpand
Operational transformation based reconciliation in the FEW File System
Optimistic replication is used to provide high data availability and support for disconnected operation in mobile computing environments. As this approach may lead to concurrent updates, a systemExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 115 REFERENCES
Exploiting weak connectivity for mobile file access
TLDR
This paper describes how the Coda File System has evolved to exploit weak connectivity networks, and the underlying theme of this evolution has been the systematic introduction of adaptivity to eliminate hidden assumptions about strong connectivity. Expand
Translucent cache management for mobile computing
TLDR
This dissertation describes the design, implementation, and evaluation of the CodaConsole, a graphical interface that makes caching translucent to users of distributed files systems, and shows that novice Coda users performed almost as well as expert Codausers. Expand
Coda: A Highly Available File System for a Distributed Workstation Environment
The design and implementation of Coda, a file system for a large-scale distributed computing environment composed of Unix workstations, is described. It provides resiliency to server and networkExpand
Disconnected Operation in the Coda File System
TLDR
This paper shows that disconmxted operation is feasible, efficient and usable by describing its design and implementation in the Coda File System and shows that caching of data, now widely used for performance, can also be exploited to improve availability. Expand
Scalable, secure, and highly available distributed file access
TLDR
Andrew and Coda are distributed Unix file systems that embody many of the recent advances in solving the problem of data sharing in large, physically dispersed workstation environments. Expand
Disconnected operation in the Coda File System
TLDR
This paper shows that disconnected operation is feasible, efficient and usable by describing its design and implementation in the Coda File System by showing that caching of data, now widely used for performance, can also be exploited to improve availability. Expand
Removing Bottlenecks in Distributed Filesystems: Coda InterMezzo as examples
TLDR
Performance analysis of Coda and NFS shows that in order to achieve local disk performance on read traffic the kernel needs more autonomy, and in Coda this leads to satisfactory results, both in micro benchmarks and in a http server benchmark. Expand
Flexible and Safe Resolution of File Conflicts
TLDR
The design combines a rule-based approach to ASR selection with transactional encapsulation of ASR execution and shows how such an approach leads to flexible and efficient file resolution without loss of security or robustness. Expand
Lightweight recoverable virtual memory
TLDR
RVM is described, an efficient, portable, and easily used implementation of recoverable virtual memory for Unix environments that allows independent control over the transactional properties of atomicity, permanence, and serializability. Expand
Improving data consistency in mobile computing using isolation-only transactions
  • Qi Lu, M. Satyanarayanan
  • Computer Science
  • Proceedings 5th Workshop on Hot Topics in Operating Systems (HotOS-V)
  • 1995
TLDR
This paper presents a new mechanism called isolation-only transaction (IOT) that uses serializability constraints to automatically detect read/write conflicts and provides a set of options for automatic and manual conflict resolution. Expand
...
1
2
3
4
5
...