A Novel Workload Allocation Strategy for Batch Jobs

SHENFIELD, Alex and FLEMING, P.J. (2013). A Novel Workload Allocation Strategy for Batch Jobs. International Journal of Computing and Network Technology, 1 (1), 1-17.

Preview

PDF IJCNT010102.pdf - Published Version Creative Commons Attribution Non-commercial Share Alike. Download (968kB) | Preview

Abstract

The distribution of computational tasks across a diverse set of geographically distributed heterogeneous resources is a critical issue in the realisation of true computational grids. Conventionally, workload allocation algorithms are divided into static and dynamic approaches. Whilst dynamic approaches frequently outperform static schemes, they usually require the collection and processing of detailed system information at frequent intervals - a task that can be both time consuming and unreliable in the real-world. This paper introduces a novel workload allocation algorithm for optimally distributing the workload produced by the arrival of batches of jobs. Results show that, for the arrival of batches of jobs, this workload allocation algorithm outperforms other commonly used algorithms in the static case. A hybrid scheduling approach (using this workload allocation algorithm), where information about the speed of computational resources is inferred from previously completed jobs, is then introduced and the efficiency of this approach demonstrated using a real world computational grid. These results are compared to the same workload allocation algorithm used in the static case and it can be seen that this hybrid approach comprehensively outperforms the static approach.

Item Type:	Article
Identification Number:	https://doi.org/10.12785/IJCNT/010102
Page Range:	1-17
SWORD Depositor:	Symplectic Elements
Depositing User:	Symplectic Elements
Date Deposited:	15 May 2020 14:59
Last Modified:	18 Mar 2021 01:46
URI:	https://shura.shu.ac.uk/id/eprint/26084

Actions (login required)

View Item

Downloads

Publication Metrics