• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Online bicriteria load balancing using object reallocation

      Thumbnail
      View / Download
      259.6 Kb
      Author
      Tse, S. S. H.
      Date
      2009-03
      Source Title
      IEEE Transactions on Parallel and Distributed Systems
      Print ISSN
      1045-9219
      Publisher
      Institute of Electrical and Electronics Engineers
      Volume
      20
      Issue
      3
      Pages
      379 - 388
      Language
      English
      Type
      Article
      Item Usage Stats
      64
      views
      46
      downloads
      Metadata
      Show full item record
      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. © 2009 IEEE.
      Keywords
      Distributed file server
      Document placement
      Communication channels (information theory)
      Control theory
      Scheduling
      Scheduling algorithms
      Security of data
      Approximate algorithms
      Bi criterion
      Heterogeneous computing
      Heterogeneous servers
      Independent parameters
      Load balancing problems
      Load-balancing
      Lower bounds
      Nonuniform requirement
      Object reallocations
      Storage spaces
      Time complexity
      Trade-off curves
      Upper bounds
      Worst case
      Servers
      Permalink
      http://hdl.handle.net/11693/22828
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/TPDS.2008.79
      Collections
      • Department of Computer Engineering 1308

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University | Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin