Database Location in Computer Networks
Journal of the ACM (JACM)
Compact, adaptive placement schemes for non-uniform requirements
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Incremental data allocation and reallocation in distributed database systems
Data warehousing and web engineering
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
Data Distribution Algorithms For Load Balanced Fault-Tolerant Web Access
SRDS '97 Proceedings of the 16th Symposium on Reliable Distributed Systems
Runtime reallocation of divisible load under processor execution deadlines
WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
Approximate Algorithms for Document Placement in Distributed Web Servers
IEEE Transactions on Parallel and Distributed Systems
Pareto approximations for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing their loads and required storage spaces.We first revisit the best existing solution for document placement, and rewrite it in our first algorithm by imposing some flexibilities. The second algorithm bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively; and more importantly, for each server, the value of at least one parameter is far from its worst case. The time complexities for both algorithm are O(logM).