Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Analytic Queueing Network Models for Parallel Processing of Task Systems
IEEE Transactions on Computers
A survey of distributed deadlock detection algorithms
ACM SIGMOD Record
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Design of partially replicated distributed database systems: an integrated methodology
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems
IEEE Transactions on Computers
Dynamic file migration in distributed computer systems
Communications of the ACM
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
Design of optimal distributed file systems: a framework for research
ACM SIGOPS Operating Systems Review
Intelligent database caching through the use of page-answers and page-traces
ACM Transactions on Database Systems (TODS)
Regeneration with Virtual Copies for Distributed Computing Systems
IEEE Transactions on Software Engineering
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Adaptive information system design: one query at a time
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Optimal Selection of CPU Speed, Device Capacities, and File Assignments
Journal of the ACM (JACM)
Distributed functions allocation for reliability and delay optimization
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Multimedia File Allocation on VC Networks Using Multipath Routing
IEEE Transactions on Computers
Distributing a database for parallelism
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
An approximation algorithm for a file-allocation problem in a hierarchical distributed system
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Horizontal data partitioning in database design
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
An approximation algorithm to the file allocation problem in computer networks
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems
Distributed and Parallel Databases
A Model for Database Allocation Incorporating a Concurrency Control Mechanism
IEEE Transactions on Knowledge and Data Engineering
Optimal Allocation for Partially Replicated Database Systems on Ring Networks
IEEE Transactions on Knowledge and Data Engineering
Expert Design of Local Area Networks
IEEE Expert: Intelligent Systems and Their Applications
File Allocation in Distributed Databases with Interaction between Files
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
A queueing network approach to the module allocation problem in distributed systems
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Hardware configuration selection through discretizing a continuous variable solution
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Protocol considerations for software controlled access methods in distributed data bases
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
A critical overview of computer performance evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Network file storage with graceful performance degradation
ACM Transactions on Storage (TOS)
A survey of research and development in distributed database management
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
The ADD system: an architecture for distributed databases
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
The Isomorphism of Simple File Allocation
IEEE Transactions on Computers
File Allocation in a Distributed Computer Communication Network
IEEE Transactions on Computers
IEEE Transactions on Computers
Optimal Design of Distributed Information Systems
IEEE Transactions on Computers
Comparison and analysis of ten static heuristics-based Internet data replication techniques
Journal of Parallel and Distributed Computing
DIALOG: a distributed processor organization for database machine
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Distributed and Parallel Databases
Mosaic-Net: a game theoretical method for selection and allocation of replicas in ad hoc networks
The Journal of Supercomputing
Location of computers and multiple files in distributed computer systems
Mathematical and Computer Modelling: An International Journal
A Model and Decision Procedure for Data Storage in Cloud Computing
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Hi-index | 0.04 |
The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two aspects of the design are tightly coupled by means of an average message delay constraint. The objective is to allocate copies of information files to network nodes and capacities to network links so that a minimum cost is achieved subject to network delay and file availability constraints. A model for solving the problem is formulated and the resulting optimization problem is shown to fall into a class of nonlinear integer programming problems. Deterministic techniques for solving this class of problems are computationally cumbersome, even for small size problems. A new heuristic algorithm is developed, which is based on a decomposition technique that greatly reduces the computational complexity of the problem. Numerical results for a variety of network configurations indicate that the heuristic algorithm, while not theoretically convergent, yields practicable low cost solutions with substantial savings in computer processing time and storage requirements. Moreover, it is shown that this algorithm is capable of solving realistic network problems whose solutions using deterministic techniques are computationally intractable.