The Community for Technology Leaders
RSS Icon
Issue No.08 - Aug. (2013 vol.24)
pp: 1644-1650
S. S. H. Tse , Comput. Eng. Dept., Istanbul Univ., Istanbul, Turkey
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 an online approximate solution for balancing their loads and required storage spaces upon placements and deletions. By placement (resp. deletion), we mean to insert a document into (resp. remove a document from) a server system. The main technique is to keep two global quantities large enough. To the best of our knowledge, the technique is novel, and the result is the first one, in the literature. Our result works for any sequences of document placements and deletions. For each deletion, a limited number of documents are reallocated. The load and storage space bounds are 1.5 to 4 times those in the best existing result for sole placements. We refer sole placements to those placement algorithms that do not allow any reallocation and replication. The time complexity, for each operation, is O(logMN), where M is the number of servers, and N is the number of existing documents in the servers, plus the reallocation cost for document deletion. The price for handling document deletion is almost totally reflected by the reallocation cost, and the higher bounds of load and storage spaces, while the O(logN) additive term in the time complexity serves as the remainder.
Online services, Algorithm design and analysis, Parallel computing, Load management, Document handling,distributed and parallel computing, Approximate, distributed, online algorithm, load balancing, scheduling, document placement, deletion, reallocation
S. S. H. Tse, "Online Balancing Two Independent Criteria upon Placements and Deletions", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 8, pp. 1644-1650, Aug. 2013, doi:10.1109/TPDS.2012.253
[1] G.C. Amita, "Incremental Data Allocation and Reallocation in Distributed Database Systems," Data Warehousing and Web Engineering, pp. 137-160, IRM Press, 2002.
[2] M. Andrews, M.X. Goemans, and L. Zhang, "Improved Bounds for On-line Load Balancing," Algorithmica, vol. 23, pp. 278-301, 1999.
[3] 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.
[4] 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.
[5] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed., McGraw-Hill, 2001.
[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, 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 on High Performance Computing in the Asia-Pacific Region, vol. 1, pp. 158-163, May 2000.
[11] D.E. Knuth, The Art of Computer Programming: Sorting and Searching, vol. 3, 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] S.S.H. Tse, "Online Balancing Two Independent Criteria," Proc. IFIP Int'l Conf. Network and Parallel Computing, pp. 244-254, 2008.
53 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool