Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Optimal allocation of file servers in a local network environment
IEEE Transactions on Software Engineering
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
A weighted voting algorithm for replicated directories
Journal of the ACM (JACM)
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
Increasing availability under mutual exclusion constraints with dynamic vote reassignment
ACM Transactions on Computer Systems (TOCS)
IEEE Transactions on Software Engineering
A distributed facility for load sharing and parallel processing among workstations
Journal of Systems and Software
Algorithms for file replication in a distributed system
Journal of Systems and Software
Voting and relocation strategies preserving consistency among replicated files
ICDT '90 Proceedings of the third international conference on database theory on Database theory
On the availability of a distributed computer system with failing components
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Consistency and recovery control for replicated files
Proceedings of the tenth ACM symposium on Operating systems principles
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Optimal program and data locations in computer networks
Communications of the ACM
Some theorems to aid in solving the file allocation problem
Communications of the ACM
Catalogue of Distributed File-Operating Systems
Catalogue of Distributed File-Operating Systems
A Model for Database Allocation Incorporating a Concurrency Control Mechanism
IEEE Transactions on Knowledge and Data Engineering
Managing Replicated Files in Partitioned Distributed Database Systems
Proceedings of the Third International Conference on Data Engineering
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
Enhancements to the Voting Algorithm
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
A Priority-Driven, Consistency-Preserving Strategy for the Relocation Problem of Replicated Files
Architektur von Rechensystemen, Tagungsband, 11. ITG/GI-Fachtagung
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A study of optimal file site assignment and communication network configuration in remote-access computer message processing and communication systems
ACM SIGOPS Operating Systems Review
A brief survey of current work on network attached peripherals (extended abstract)
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
In this paper, the problem of determining an optimal location strategy for an individual program execution is considered. In addition, we propose a heuristic approach for the dynamic file allocation problem. In order to reduce the complexity of the optimization problems, a cluster-based approach is used.To access the data files of a distributed file system, a user initiates a program execution. Based on the current allocation of the program and data files as well as the knowledge about the characteristics of the programs, a first optimization calculates the optimal cluster for each individual program execution. The objective of this optimization is the minimization of the intercluster traffic of an individual program execution. Within the optimal cluster, a simple load-balancing strategy is used to determine the corresponding executing node.A second optimization looks for file allocations where the global intercluster traffic is minimized subject to the following constraints: minimal number of file copies, availability, and storage capacity.Experimental results showing the efficiency of the proposed algorithms are examined, and the implications of the model for the design of very large distributed file systems are discussed.