Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Performance-aware load balancing for multiclusters

Tools
- Tools
+ Tools

UNSPECIFIED (2004) Performance-aware load balancing for multiclusters. In: 2nd International Symposium on Parallel and Distributed Processing and Applications (ISPA 2004), DEC 13-15, 2004, Hong Kong, PEOPLES R CHINA.

Full text not available from this repository.

Abstract

In a multicluster architecture, where jobs can be submitted through each constituent cluster, the job arrival rates in individual clusters may he 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 Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name: LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title: PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS
Publisher: SPRINGER-VERLAG BERLIN
ISBN: 3-540-24128-0
ISSN: 0302-9743
Editor: Cao, J and Yang, LT and Guo, M and Lau, F
Date: 2004
Volume: 3358
Number of Pages: 13
Page Range: pp. 635-647
Publication Status: Published
Title of Event: 2nd International Symposium on Parallel and Distributed Processing and Applications (ISPA 2004)
Location of Event: Hong Kong, PEOPLES R CHINA
Date(s) of Event: DEC 13-15, 2004
URI: http://wrap.warwick.ac.uk/id/eprint/7457

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us