University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • Sign in
  • Computer Science Repository
  • More…

    Computer Science Repository

    • Home
    • About
    • Browse by Year
    • Browse by Subject
    • Browse by Division
    • Browse by Author
      • Login

    Performance-Aware Load Balancing for Multiclusters

    He, L., Jarvis, S.A., Bacigalupo, D.A., Spooner, D.P. and Nudd, G.R. (2004) Performance-Aware Load Balancing for Multiclusters. In: 2nd International Symposium on Parallel and Distributed Processing and Applications (ISPA'04), Hong Kong.

    [img]
    Preview
    PDF - Published Version
    Download (176Kb) | Preview

      Abstract

      In a multicluster architecture, where jobs can be submitted through each constituent cluster, the job arrival rates in individual clusters may be uneven and the load therefore needs to be balanced among clusters. In this paper we investigate load balancing for two types of jobs, namely non-QoS and QoS-demanding jobs and as a result, two performance-specific load balancing strategies (called ORT and OMR) are developed. The ORT strategy is used to obtain the optimised mean response time for non-QoS jobs and the OMR strategy is used to achieve the optimised mean miss rate for QoS-demanding jobs. The ORT and OMR strategies are mathematically modelled combining queuing network theory to establish sets of optimisation equations. Numerical solutions are developed to solve these optimisation equations, and a so called fair workload level is determined for each cluster. When the current workload in a cluster reaches this pre-calculated fair workload level, the jobs subsequently submitted to the cluster are transferred to other clusters for execution. The effectiveness of both strategies is demonstrated through theoretical analysis and experimental verification. The results show that the proposed load balancing mechanisms bring about considerable performance gains for both job types, while the job transfer frequency among clusters is considerably reduced. This has a number of advantages, in particular in the case where scheduling jobs to remote resources involves the transfer of large executable and data files.

      Item Type: Conference or Workshop Item (Paper)
      Uncontrolled Keywords: pcav hpsg business scheduling performance distributed system
      Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
      Divisions: Faculty of Science > Computer Science
      Depositing User: Simon Hammond
      Date Deposited: 14 Dec 2010 10:49
      Last Modified: 23 Feb 2012 09:08
      URI: http://eprints.dcs.warwick.ac.uk/id/eprint/442

      Actions (login required)

      View Item
      Close this email form
      Page contact: Repository administrator Last revised: Wed 21 Mar 2012
      • Sign in
      • | Powered by EPrints 3