Data Management

The Optimal Resource Discovery and Allocation Algorithm for One Hop Using Anonymous Arbitrary Topology

Download Now Free registration required

Executive Summary

A distributed system consists of, possibly heterogeneous, computing nodes connected by communication network that do not share memory or clock. One of the main benefits of distributed systems is resource sharing which speeds up computation, enhances data availability and reliability. However resources must be discovered and allocated before they can be shared. Virtual caching is a new caching scheme which allows a host node to grant authority of caching pages in some fraction of its own cache to nearby nodes. However the virtual caching protocol doesn't mention how a client node obtains virtual cache from remote host. To address this problem the authors formulate a resource discovery and allocation problem.

  • Format: PDF
  • Size: 235.49 KB