论文信息 - An approximation algorithm for a file-allocation problem in a hierarchical distributed system

An approximation algorithm for a file-allocation problem in a hierarchical distributed system

A file allocation problem in a hierarchical distributed computer network is examined. It is shown that the problem is NP-hard. An approximation algorithm is suggested. It is estimated that the approximation algorithm has a high chance of obtaining the optimal solution. Experimental results show that the difference between the optimal solution and the solution generated by the approximation algorithm is no more than 4% away from the optimal solution.

Clement T. Yu | K. Lam

[1] R. G. Casey,et al. Allocation of copies of a file in an information network , 1899, AFIPS '72 (Spring).

[2] Kapali P. Eswaran. Placement of Records in a File and File Allocation in a Computer , 1974, IFIP Congress.

[3] Wesley W. Chu. Optimal file allocation in a multicomputer information system , 1968, IFIP Congress.

[4] K. Dan Levin,et al. Optimal program and data locations in computer networks , 1977, CACM.

[5] J. Spruce Riordon,et al. Optimal allocation of resources in distributed information networks , 1976, TODS.

[6] Katriel Dan Levin. Organizing distributed data bases in computer networks. , 1974 .

[7] Shi-Kuo Chang. Data base decomposition in a hierarchical computer system , 1975, SIGMOD '75.

[8] Sakti P. Ghosh. Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching , 1976, IEEE Transactions on Software Engineering.