Optimal Resource Placement in a Distributed System. (Extended Abstract).

Abstract

Consider the problem of locating t resources on the nodes of a complete binary tree of n leaves so as to minimize the expected total distance from each of t simultaneous random requests at the leaves to the resource with which each is optimally matched. The optimal placement of resources yields an expected total distance of at most ct + 2 log(n/t). Such a placement can be found in time 0(log n). (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1980
Accession Number
ADA090772

Entities

People

  • Michael J. Fischer
  • Nancy D. Griffeth
  • Nancy Lynch

Organizations

  • University of Washington

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Binomials
  • Computations
  • Computer Science
  • Computers
  • Contracts
  • Information Systems
  • Marine Corps
  • Mathematics
  • Military Research
  • New York
  • Probability
  • Program Management
  • Trees (Data Structures)
  • Universities

Readers

  • Aerospace Test and Evaluation
  • Approximation Theory.
  • Operations Research