Online balancing two independent criteria
Tse, Savio S.H.
IFIP International Conference on Network and Parallel Computing NPC 2008: Network and Parallel Computing
244 - 254
Item Usage Stats
MetadataShow full item record
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.
Distributed file server
Parallel processing systems
Security of data
Published Version (Please cite this version)https://doi.org/10.1007/978-3-540-88140-7_22
Showing items related by title, author, creator and subject.
Akçay, H. G.; Aksoy, S. (Institute of Electrical and Electronics Engineers, 2008-07)The object-based analysis of remotely sensed imagery provides valuable spatial and structural information that is complementary to pixel-based spectral information in classification. In this paper, we present novel methods ...
Sarıyüce, A. E.; Gedik, B.; Jacques-Silva, G.; Wu, Kun-Lung; Catalyurek, U.V. (Association for Computing Machinery, 2016)A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, ...
Sengezer, N.; Karasan, E. (Springer, 2004)In this paper, we study the problem of placing limited number of wavelength converting nodes in a multi-fiber network with static traffic demands and propose a tabu search based heuristic algorithm. The objective of the ...