A Trace-Driven Comparison of Algorithms for Multi-Process Prefetching and Caching.

Abstract

Recently two groups of researchers have proposed systems that exploit application knowledge to improve I/O performance. Both systems use application knowledge to prefetch data thereby masking I/O latency and to improve file buffer cache performance thereby avoiding slow I/O accesses altogether. Unfortunately, published studies of these two systems are incomparable. This technical report is a follow-on to a paper to appear in OSDI96 comparing the TIP2 system of Patterson, Gibson, et al, and the LRU-SP system of Cao, Felten, Karlin and Li, co-written by the two groups. The OSDI paper considers the case of a single process with full advance knowledge of requests. In this technical report we consider multiple processes, each of which has either full advance knowledge (complete hints) or no advance knowledge (no hints). Our results can be summarized as follows: the cost-benefit analysis of TIP2 allows better performance when optimal buffer allocation does not correspond to process consumption rates.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1996
Accession Number
ADA317570

Entities

People

  • Andrew Tomkins
  • Garth Gibson
  • R. H. Patterson

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Access Time
  • Algorithms
  • Bandwidth
  • Computations
  • Computer Science
  • Computers
  • Corporations
  • Cost Estimates
  • Costs
  • Data Rate
  • Data Storage Systems
  • Data Visualization
  • Operating Systems
  • Scheduling (Production)
  • Simulations
  • Simulators
  • Three Dimensional

Fields of Study

  • Computer science

Readers

  • Organizational Process Management (OPM).
  • Parallel and Distributed Computing.