Online balancing two independent criteria
Date
2008-10
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
4
views
views
13
downloads
downloads
Citation Stats
Series
Abstract
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). © 2008 Springer Berlin Heidelberg.
Source Title
IFIP International Conference on Network and Parallel Computing NPC 2008: Network and Parallel Computing
Publisher
Springer
Course
Other identifiers
Book Title
Keywords
Approximate, Distributed file server, Document placement, Load balancing, Online algorithm, Control theory, Parallel algorithms, Parallel processing systems, Security of data, Algorithms, Clustering algorithms, Network management, Resource allocation, Scheduling, Scheduling algorithms, Distributed, Load balancing, Servers, On-line algorithms
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English