The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2012 vol.61)
pp: 1601-1610
Savio S.H. Tse , Istanbul University, Istanbul
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 three online approximate solutions for balancing their loads and required storage spaces upon placements. We first revisit the best existing solution for simple placement (i.e., without replication and reallocation), and rewrite it in our first algorithm by imposing some flexibilities. Our second algorithm is to apply document replication. The upper bound of load is significantly reduced, without sacrificing that of the storage space. This upper bound contains at least one special case which can never be outperformed by any online simple placement algorithms. Lastly, we show that there exists an online algorithm which allows very little document reallocation, but gives an upper bound result on the load and storage space, which is never reachable by any online algorithms for simple placement. The time complexities of the first two algorithms are in O(\log M), and the last algorithm runs in O(\log MN) time, where M is the number of servers, and N is the number of existing documents.
INDEX TERMS
Servers, Upper bound, Load management, Approximation algorithms, Algorithm design and analysis, Partitioning algorithms, File servers, document placement, Servers, Upper bound, Load management, Approximation algorithms, Algorithm design and analysis, Partitioning algorithms, File servers, replication, Servers, Upper bound, Load management, Approximation algorithms, Algorithm design and analysis, Partitioning algorithms, File servers, reallocation, Approximate, distributed, online algorithm, load balancing, scheduling, distributed file server
CITATION
Savio S.H. Tse, "Online Bounds on Balancing Two Independent Criteria with Replication and Reallocation", IEEE Transactions on Computers, vol.61, no. 11, pp. 1601-1610, Nov. 2012, doi:10.1109/TC.2011.168
REFERENCES
[1] G. Aggarwal, R. Motwani, and A. Zhu, “The Load Rebalancing Problem,” J. Algorithms, vol. 60, no. 1, pp. 42-59, 2006.
[2] G.C. Amita, “Incremental Data Allocation and Reallocation in Distributed Database Systems,” Data Warehousing and Web Engineering, pp. 137-160, Idea Group, 2002.
[3] M. Andrews, M.X. Goemans, and L. Zhang, “Improved Bounds for On-Line Load Balancing,” Algorithmica, vol. 23, pp. 278-301, 1999.
[4] 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.
[5] 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.
[6] M.L. Fisher and D.S. Hochbaum, “Database Location in Computer Networks,” J. ACM, vol. 27, pp. 718-735, 1980.
[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] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[9] E. Haddad, “Runtime Reallocation of Divisible Load Under Processor Execution Deadlines,” Proc. Third Workshop Parallel and Distributed Real-Time Systems, pp. 30-31, Apr. 1995.
[10] 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 High Performance Computing Asia-Pacific Region, vol. 1, pp. 158-163, May 2000.
[11] D.E. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, Section 6.2.4, Addison-Wesley, 1973.
[12] B. Narendran, S. Rangarajan, and S. Yajnik, “Data Distribution Algorithms for Load Balanced Fault-Tolerant Web Access,” Proc. 16th Symp. Reliable Distributed Systems, pp. 97-106, Oct. 1997.
[13] J.F. RudinIII, “Improved Bounds for the Online Scheduling Problem,” PhD thesis, The Univ. of Texas at Dallas, 2001.
[14] É. Saule, P.F. Dutot, and G. Mounié, “Scheduling with Storage Constraints,” Proc. 22nd Int'l Parallel and Distributed Processing Symp., Apr. 2008.
[15] 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.
[16] S.S.H. Tse, “Online Bicriteria Load Balancing Using Object Reallocation,” IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 3, pp. 379-388, Mar. 2009.
[17] J. Westbrook, “Load Balancing for Response Time,” J. Algorithms, vol. 35, no. 1, pp. 1-16, 2000.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool