Allocating non-real-time and soft real-time jobs in multiclusters

Research output: Contribution to journalArticlepeer-review

Authors

  • Ligang He
  • Daniel P. Spooner
  • Hong Jiang
  • Donna N. Dillenberger
  • Graham R. Nudd

Colleges, School and Institutes

External organisations

  • IEEE
  • University of Warwick
  • University of Nebraska - Lincoln
  • IBM Research Division, T.J. Watson Research Center

Abstract

This paper addresses workload allocation techniques for two types of sequential jobs that might be found in multicluster systems, namely, non-real-time jobs and soft real-time jobs. Two workload allocation strategies, the Optimized mean Response Time (ORT) and the Optimized mean Miss Rate (OMR), are developed by establishing and numerically solving two optimization equation sets. The ORT strategy achieves an optimized mean response time for non-real-time jobs, while the OMR strategy obtains an optimized mean miss rate for soft real-time jobs over multiple clusters. Both strategies take into account average system behaviors (such as the mean arrival rate of jobs) in calculating the workload proportions for individual clusters and the workload allocation is updated dynamically when the change in the mean arrival rate reaches a certain threshold. The effectiveness of both strategies is demonstrated through theoretical analysis. These strategies are also evaluated through extensive experimental studies and the results show that when compared with traditional strategies, the proposed workload allocation schemes significantly improve the performance of job scheduling in multiclusters, both in terms of the mean response time (for non-real-time jobs) and the mean miss rate (for soft real-time jobs).

Details

Original languageEnglish
Pages (from-to)99-111
Number of pages13
JournalIEEE Transactions on Parallel and Distributed Systems
Volume17
Issue number2
Publication statusPublished - Feb 2006

Keywords

  • Distributed systems, Numerical algorithms, Parallel systems, Real-time systems, Scheduling