More Web Proxy on the site http://driver.im/

article

Free access

Optimal program and data locations in computer networks

Authors:

Howard L. Morgan,

K. Dan LevinAuthors Info & Claims

Communications of the ACM, Volume 20, Issue 5

Pages 315 - 322

https://doi.org/10.1145/359581.359591

Published: 01 May 1977 Publication History

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]

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.

Digital Library

[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.

Digital Library

[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]

Levin, K.D. Organizing distributed data bases in computer networks. Ph.D. Diss. U. of Pennsylvania, Phila., Pa. 1974.

Digital Library

[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.

Digital Library

[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

Schaekermann MGoh JLarson KLaw E(2018)Resolvable vs. Irresolvable DisagreementProceedings of the ACM on Human-Computer Interaction10.1145/32744232:CSCW(1-19)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1145/3274423
Chiang CKasunic ASavage S(2018)Crowd CoachProceedings of the ACM on Human-Computer Interaction10.1145/32743062:CSCW(1-17)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1145/3274306
Gibbons JHenglein FHinze RWu N(2018)Relational algebra by way of adjunctionsProceedings of the ACM on Programming Languages10.1145/32367812:ICFP(1-28)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236781
Show More Cited By

Recommendations

Economic Perspectives on the History of the Computer Time-Sharing Industry, 1965-1985

The history of the computer time-sharing industry is one of the unwritten chapters in the overall history of computing. In this article, we show that the time-sharing industry constituted a major sector of the computer services industry until the early ...
A computer network monitoring system

In order to help satisfy'an apparent need for tools for monitoring the activities of a computer network (see Mamrak [1]), a system of special hardware and software, called a Computer Network Monitoring System (CNMS), is being implemented in the' ...
Modular data storage with Anvil
SOSP '09: Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles

Databases have achieved orders-of-magnitude performance improvements by changing the layout of stored data -- for instance, by arranging data in columns or compressing it before storage. These improvements have been implemented in monolithic new engines,...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

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

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

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: 01 May 1977

Published in CACM Volume 20, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

135
Total Citations
View Citations
460
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)5

Reflects downloads up to 10 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Schaekermann MGoh JLarson KLaw E(2018)Resolvable vs. Irresolvable DisagreementProceedings of the ACM on Human-Computer Interaction10.1145/32744232:CSCW(1-19)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1145/3274423
Chiang CKasunic ASavage S(2018)Crowd CoachProceedings of the ACM on Human-Computer Interaction10.1145/32743062:CSCW(1-17)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1145/3274306
Gibbons JHenglein FHinze RWu N(2018)Relational algebra by way of adjunctionsProceedings of the ACM on Programming Languages10.1145/32367812:ICFP(1-28)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236781
Giraldo JUrbina DCardenas AValente JFaisal MRuths JTippenhauer NSandberg HCandell R(2018)A Survey of Physics-Based Attack Detection in Cyber-Physical SystemsACM Computing Surveys10.1145/320324551:4(1-36)Online publication date: 25-Jul-2018
https://dl.acm.org/doi/10.1145/3203245
Chen YSu LXu J(2017)Distributed Statistical Machine Learning in Adversarial SettingsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31545031:2(1-25)Online publication date: 19-Dec-2017
https://dl.acm.org/doi/10.1145/3154503
Schardl TDenniston TDoucet DKuszmaul BLee ILeiserson C(2017)The CSI Framework for Compiler-Inserted Program InstrumentationProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31545021:2(1-25)Online publication date: 19-Dec-2017
https://dl.acm.org/doi/10.1145/3154502
Chakrabarty DKrishnaswamy RKumar A(2017)The Heterogeneous Capacitated k-Center ProblemInteger Programming and Combinatorial Optimization10.1007/978-3-319-59250-3_11(123-135)Online publication date: 24-May-2017
https://doi.org/10.1007/978-3-319-59250-3_11
Arun Sen Rakes TFranz L(2016)Network cost analysis for planning configuration change in distributed systemsJournal of Information Science10.1177/01655515870130040613:4(235-246)Online publication date: Jul-2016
https://doi.org/10.1177/016555158701300406
Fung KLam C(2016) The Database Entropy Concept And Its Application To The Data Allocation Problem * INFOR: Information Systems and Operational Research10.1080/03155986.1980.1173179818:4(354-363)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1980.11731798
Sen GKrishnamoorthy MRangaraj NNarayanan V(2015)Exact approaches for static data segment allocation problem in an information networkComputers and Operations Research10.1016/j.cor.2014.05.02362:C(282-295)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.cor.2014.05.023
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

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

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents