By Topic

File allocation on homogeneous local computer systems with two-level multiaccess networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Y. -N. Lien ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; Y. -L. Chang ; B. W. Wah

Various versions of the file allocation problem on homogeneous two-level local multiaccess networks are examined. The problems associated with file allocation are more simple on two-level networks than on general point-to-point networks because the communication cost for accessing a file is reduced to a three-value variable. File allocation with storage-limit constraints is still NP-hard. The optimal solution, given these conditions, involves transformation into a pure zero-one integer programming problem and a search algorithm based on E. Balas's additive algorithm (1965). In the case in which the system is dominated by the communication cost, the simple file allocation problem is polynomially solvable. An efficient heuristic algorithm with guaranteed performance is proposed for this special case

Published in:

Data Engineering, 1988. Proceedings. Fourth International Conference on

Date of Conference:

1-5 Feb 1988