ACM Home Page
Please provide us with feedback. Feedback
Optimal program and data locations in computer networks
Full text PdfPdf (761 KB)
Source
Communications of the ACM archive
Volume 20 ,  Issue 5  (May 1977) table of contents
Pages: 315 - 322  
Year of Publication: 1977
ISSN:0001-0782
Authors
Howard L. Morgan  Univ. of Pennsylvania, Philadelphia
K. Dan Levin  Univ. of Pennsylvania, Philadelphia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 36,   Citation Count: 31
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/359581.359591
What is a DOI?

ABSTRACT

An optimization procedure for the allocation of program and data files in a computer network is presented. This algorithm takes into account the dependencies between files and programs such as occur in real heterogeneous computer networks. Insights into whether or not to convert programs from one computer to another can also be gained from the model. A search procedure for the file location problem is described, along with an example and a possible application of the model.


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
 
2
Casey, R.G. Allocation of copies of a file in an information network. Proc. AFIPS 1972 STCC, Vol. 40, AFIPS Press, Montvale, N.J., 1972.
 
3
Chu, W.W. Optimal file allocation in a multicomputer information system. Information Processing '68, North-Holland Pub. Co., Amsterdam, 1969, pp. 1219-1225; also IEEE Trans. Comptrs. C-18, 10 (Oct. 1969), 885-889.
 
4
Gonzales, A.R.H. Solution of the traveling salesman problems by dynamic programming on the hypercube. M.S. Th., School of Industrial Management, M.I.T., Cambridge, Mass., May 1962.
 
5
Ellwein, L.B. Fixed charge location allocation problems with capacity and configuration constraints. Ph.D. Diss., Dept. Indust. Eng., Stanford U., Stanford, Calif., August 1970.
 
6
Ellwein, L.B. A flexible enumeration scheme for zero-one programming. Oper. Res. 22, 2 (Feb. 1974), 145-150.
 
7
Kahn, R.E. Resource-sharing computer communication networks. Proc. IEEE, 61 (Nov. 1972), 1397-1407 (special issue on computer communications).
 
8
Khumwala, B.M. An efficient branch and bound algorithm for the warehouse location problem. Manage. Sci. 18, 12 (Aug. 1972), B-718-B-731.
 
9
Kleinrock, L. Models for computer networks. Proc. Int. Conf. on Communication, Boulder, Colo., June 1969, pp. 2.9-2.16.
 
10
 
11
Levin, K.D., and Morgan, H.L. Optimizing distributed data bases-a framework for research. Proc. AFIPS 1975 NCC, Vol. 44, AFIPS Press, Montvale, N.J., pp. 473-478.
 
12
Levin, K.D. Two algorithms for optimal file assignments in heterogeneous computer networks. Tech. Rep. 75-08-02, Dept. Decision Sci., The Wharton School, U. of Pennsylvania, Phila., Pa.,
 
13
Manne, A.S. Plant location under economies of scaledecentralization and computations. Manage. Sci. 11 (Nov. 1964), 213-225.
 
14
Mahmoud, S.A. Resource allocation and file access control in distributed information networks. Ph.D. Diss. Syst. Eng. Dept., Carleton College, Northfield, Minn., 1975.
 
15
Whitney, V.K.M. A study of optimal file assignment and communication network configuration. Ph.D. Th. U. of Michigan, Ann Arbor, Mich., 1970.

CITED BY  31

Collaborative Colleagues:
Howard L. Morgan: colleagues
K. Dan Levin: colleagues