ACM Home Page
Please provide us with feedback. Feedback
An approximation algorithm for a file-allocation problem in a hierarchical distributed system
Full text pdf formatPdf (700 KB)
Source International Conference on Management of Data archive
Proceedings of the 1980 ACM SIGMOD international conference on Management of data table of contents
Santa Monica, California
SESSION: Distributed databases table of contents
Pages: 125 - 132  
Year of Publication: 1980
ISBN:0-89791-018-4
Authors
K. Lam  University of Illinois at Chicago Circle, Chicago, IL
C. T. Yu  University of Illinois at Chicago Circle, Chicago, IL
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Citation Count: 3
Additional Information:

abstract   references   cited by   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/582250.582270
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Casey, R.G., "Allocation of copies of a file in an information network," AFIPS Conference Proceedings, Vol. 40, 1972 Spring Joint Computer Conference, May 1972, pp. 617--625.
2
 
3
Chu, W.W., "Optimal file allocation in a multi-computer information system," IEEE Transactions on Computers, Vol. C-18, No. 10, October 1969, pp. 885--889.
 
4
Eswaran, K.P., "Placement of records in a file and file allocation in a computer network," IFIP, August 1974, pp. 304--307.
 
5
Foley, J.D. and Brownlee, E.H., "A model of distributed processing in computer networks, with application to satellite graphics," Proc. of International Conference on Computer Communication, August 1974, Stockholm, pp. 330--336.
 
6
Ghosh, S.P., "Distributing a data base with logical associations on computer network for parallel searching," IBM Research Report, 1974.
 
7
 
8
Howson, H.R., Amay, L.R. and Thorpe, W.D., "Research and Development of parametric cost models to evaluate strategies in the design of a national data bank network," Research Report, Faculty of Management, McGill University, 1974.
 
9
10
11
 
12
Whitney, V.K.M., "A study of optimal file assignment and communication network configuration in remote-access computer mesmage processing and communication systems," University of Michigan, Electrical Engineering Department, September 1970.
 
13
Urano, Y., Ono, K. and Inone, S., "Optimal design of distributed networks," Proc. of International Conference on Computer Communication, August 1974, pp. 413--420.


Peer to Peer - Readers of this Article have also read: