Optimal program and data locations in computer networks

DOI10.1145/359581.359591MaRDI QIDQ4124275zbMATH OpenOpenAlexFDO

Authors Howard Lee Morgan, K. Dan Levin

Publication date 1977

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359581.359591

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(15)

• A solution method for the non-additive resource allocation problem in distributed system design
• An integer programming model for the allocation of databases in a distributed computer system
• A quadratic programming model for optimal data distribution
• Partage de taches entre processeurs homogenes
• A solution procedure for the file allocation problem with file availability and response time
• A multiple criteria model for the allocation of data files in a distributed information system
• Configuration of fully replicated distributed database system over wide area networks
• File allocation involving worst case response times and link capacities: Model and solution procedure
• Database placement in communication networks for minimizing the overall transmission cost
• Resource allocation and capacity assignment in distributed systems
• Exact approaches for static data segment allocation problem in an information network
• Adaptation algorithm for improvement of effectiveness of distributed computer systems
• Facility location with dynamic distance functions
• Facility location models to locate data in information networks: a literature review
• Optimization of resource location in hierarchical computer networks

This page was built for publication: Optimal program and data locations in computer networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124275)