Large Granularity Cache Coherence for Intermittent Connectivity

Abstract

To function in mobile computing environments, distributed file systems must cope with networks that are slow, intermittent, or both. Intermittence vitiates the effectiveness of callback-based cache coherence schemes in reducing client-server communication, because clients must validate files when connections are reestablished. In this paper we show how maintaining cache coherence at a large granularity alleviates this problem. We report on the implementation and performance of large granularity cache coherence for the Coda File System. Our measurements confirm the value of this technique. At 9.6 Kbps. This technique takes only 4 - 20% of the time required by two other strategies to validate the cache for a sample of Coda users. Even at this speed, the network is effectively eliminated as the bottleneck for cache validation. Distributed file systems, Weak connectivity, Mobile computing, Caching, Callbacks, Volume callbacks, Coda.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1994
Accession Number
ADA278897

Entities

People

  • L. Mummert
  • Mahadev Satyanarayanan

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Bandwidth
  • Computer Science
  • Computers
  • Consistency
  • Databases
  • Directories
  • Electrical Engineering
  • Environment
  • Laptop Computers
  • Mass Storage
  • Measurement
  • Mobile Computing
  • Networks
  • Operating Systems
  • Recovery
  • Standards
  • Validation

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Parallel and Distributed Computing.