skip to main content
article
Free Access

Optimal program and data locations in computer networks

Published:01 May 1977Publication History
Skip Abstract Section

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

  1. 1 Bulfin, R.L., and Unger, V.E. Computational experience with an algorithm for the lock box problem. Proc. ACM Annual Conf., Aug. 1973, Atlanta, Ga., pp. 16-19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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.Google ScholarGoogle Scholar
  3. 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.Google ScholarGoogle Scholar
  4. 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.Google ScholarGoogle Scholar
  5. 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.Google ScholarGoogle Scholar
  6. 6 Ellwein, L.B. A flexible enumeration scheme for zero-one programming. Oper. Res. 22, 2 (Feb. 1974), 145-150.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Kahn, R.E. Resource-sharing computer communication networks. Proc. IEEE, 61 (Nov. 1972), 1397-1407 (special issue on computer communications).Google ScholarGoogle ScholarCross RefCross Ref
  8. 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.Google ScholarGoogle Scholar
  9. 9 Kleinrock, L. Models for computer networks. Proc. Int. Conf. on Communication, Boulder, Colo., June 1969, pp. 2.9-2.16.Google ScholarGoogle Scholar
  10. 10 Levin, K.D. Organizing distributed data bases in computer networks. Ph.D. Diss. U. of Pennsylvania, Phila., Pa. 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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.Google ScholarGoogle Scholar
  12. 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.,Google ScholarGoogle Scholar
  13. 13 Manne, A.S. Plant location under economies of scaledecentralization and computations. Manage. Sci. 11 (Nov. 1964), 213-225.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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.Google ScholarGoogle Scholar
  15. 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.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image Communications of the ACM
    Communications of the ACM  Volume 20, Issue 5
    May 1977
    69 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/359581
    Issue’s Table of Contents

    Copyright © 1977 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 May 1977

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader