Thumbnail
Access Restriction
Subscribed

Author Belford, Geneva G. ♦ Grapa, Enrique
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Distributed data management ♦ File allocation ♦ Computer networks
Abstract The file allocation problem — i.e. the problem of finding the optimal set of network sites at which to locate copies of a file — is known to be, in general, polynomial complete. Heuristics and other aids to finding optimal, or near-optimal, solutions are therefore much needed. In this paper we present three theorems which can be applied a priori to indicate that certain sites should (or should not) be included in an optimal allocation.
Description Affiliation: Univ. of Illnois, Urbana-Champaign (Grapa, Enrique; Belford, Geneva G.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 20
Issue Number 11
Page Count 5
Starting Page 878
Ending Page 882


Open content in new tab

   Open content in new tab
Source: ACM Digital Library