The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2009 vol.20)
pp: 379-388
Savio S.H. Tse , Bilkent University, Ankara
ABSTRACT
We study the bicriteria load balancing problem on two independent parameters under the allowance of object reallocation. The scenario is a system of $M$ distributed file servers located in a cluster, and we propose three online approximate algorithms for balancing their loads and required storage spaces during document placement. The first algorithm is for heterogeneous servers. Each server has its individual tradeoff of load and storage space under the same rule of selection. The other two algorithms are for homogeneous servers. The second algorithm combines the idea of the first one and the best existing solution for homogeneous servers. Using document reallocation, we obtain a smooth tradeoff curve of the upper bounds of load and storage space. The last one 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 of these three algorithms are $O(\log M)$ plus the cost of document reallocation.
INDEX TERMS
Distributed applications, Scheduling, Distributed file systems
CITATION
Savio S.H. Tse, "Online Bicriteria Load Balancing Using Object Reallocation", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 3, pp. 379-388, March 2009, doi:10.1109/TPDS.2008.79
REFERENCES
[1] G.C. Amita, “Incremental Data Allocation and Reallocation in Distributed Database Systems,” Data Warehousing and Web Eng., pp. 137-160, 2002.
[2] V. Biloˇ, M. Flammini, and L. Moscardelli, “Pareto Approximations for the Bicriteria Scheduling Problem,” J. Parallel and Distributed Computing, vol. 66, no. 3, pp. 393-402, 2006.
[3] A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, Adaptive Placement Schemes for Non-Uniform Requirements,” Proc. ACM Symp. Parallelism in Algorithms and Architectures (SPAA'02), Aug. 2002.
[4] S. Ceri, G. Pelagatti, and G. Martella, “Optimal File Allocation in a Computer Network: A Solution Based on the Knapsack Problem,” Computer Networks, vol. 6, pp. 345-357, 1982.
[5] L.C. Chen and H.A. Choi, “Approximation Algorithms for Data Distribution with Load Balancing of Web Servers,” Proc. IEEE Int'l Conf. Cluster Computing (CLUSTER '01), pp. 274-281, Oct. 2001.
[6] L.W. Dowdy and D.V. Foster, “Comparative Models of the File Assignment Problem,” ACM Computing Surveys, vol. 14, no. 2, pp. 287-313, 1982.
[7] R. Fleischer and M. Wahl, “Online Scheduling Revisited,” J.Scheduling, special issue on approximation algorithms for scheduling algorithms (Part 2), vol. 3, no. 6, pp. 343-353, 2000.
[8] E. Haddad, “Runtime Reallocation of Divisible Load under Processor Execution Deadlines,” Proc. Third Workshop Parallel and Distributed Real-Time Systems (WPDRTS '95), pp. 30-31, Apr. 1995.
[9] H. Harada, Y. Ishikawa, A. Hori, H. Tezuka, S. Sumimoto, and T. Takahashi, “Dynamic Home Node Reallocation on Software Distributed Shared Memory,” Proc. Fourth Int'l Conf./Exhibition on High Performance Computing in the Asia-Pacific Region (HPC-ASIA '00), vol. 1, pp. 158-163, May 2000.
[10] D.E. Knuth, The Art of Computer Programming, vol. 3. Addison-Wesley, 1973.
[11] A. Rasala, C. Stein, E. Torng, and P. Uthaisombut, “Existence Theorems, Lower Bounds and Algorithms for Scheduling to Meet Two Objectives,” Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '02), pp. 723-731, 2002.
[12] J.F. Rudin III, “Improved Bounds for the Online Scheduling Problem,” PhD dissertation, Univ. of Texas at Dallas, 2001.
[13] S.S.H. Tse, “Approximation Algorithms for Document Placement in Distributed Web Servers,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 6, pp. 489-496, June 2005.
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool