• 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 for distributed file servers

      Thumbnail
      View / Download
      378.8 Kb
      Author
      Tse, Savio
      Date
      2008-08
      Source Title
      Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007
      Publisher
      IEEE
      Pages
      218 - 222
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      128
      views
      92
      downloads
      Abstract
      We study the online bicriteria load balancing problem in a system of M distributed homogeneous file servers located in a cluster. The load and storage space are assumed to be independent. We propose two online approximate algorithms for balancing the load and required storage space of each server during document placement. Our first algorithm combines the first result In [10] and the upper bound result In [1]. With applying document reallocation, we further obtain improvement and give a smoother tradeoff curve of the upper bounds of load and storage space. This result improves the best existing solutions. The second algorithm Is for theoretical purpose. Its existence proves that the bounds for the load and the required storage space of each server, respectively, are strictly better when document reallocation Is allowed. It enhances the research In applying document reallocation. The time complexities of both algorithms are O(log M); and the cost of document reallocation should be taken into account.
      Keywords
      Document placement
      Load balancing
      Re-allocation
      Scheduling
      Document placement
      Document reallocation
      Re-allocation
      Algorithms
      Cluster analysis
      Computational complexity
      Online systems
      Resource allocation
      Servers
      Permalink
      http://hdl.handle.net/11693/26889
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/CHINACOM.2007.4469367
      Collections
      • Department of Computer Engineering 1368
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics 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 | Privacy