Scheduling through backfilling technique for HPC applications in grid computing environment

Due to the heterogeneity and complexity in grid computing, simple algorithms may not be able to deal with dynamic jobs properly. In the dynamic mode, incoming jobs reach the scheduler arbitrary; therefore, scheduling the jobs using simple policy alone could affect the performance of the scheduler. T...

Full description

Saved in:
Bibliographic Details
Main Authors: Dakkak, Omar, Awang Nor, Shahrudin, Arif, Suki
Format: Conference Proceeding
Language:English
Subjects:
backfilling
completion time
Delays
Dynamic scheduling
grid
Optimization
Processor scheduling
Runtime
Schedules
scheduling
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Due to the heterogeneity and complexity in grid computing, simple algorithms may not be able to deal with dynamic jobs properly. In the dynamic mode, incoming jobs reach the scheduler arbitrary; therefore, scheduling the jobs using simple policy alone could affect the performance of the scheduler. Thus, a policy that can handle the dynamicity efficiently is indispensable. This paper presents Swift Gap mechanism, which is a hybridization of Best Gap mechanism; alongside with Tabu search. In addition, a new decision rule based on completion time is included into the outcome mechanism. The new decision rule based on completion time has shown a significant improvement in the Quality of Service (QoS) for the end-user. Moreover, an evaluation of the proposed mechanism Swift Gap is provided. From the findings, Swift Gap outperforms Conservative Backfilling (CONS), Extensible Argonne Scheduling System (EASY) and CONS hybridized with Tabu search.
ISSN:2473-3660
DOI:10.1109/ICOS.2016.7881984