Scheduling Jobs through Gap Filling and Optimization Techniques in Computational Grid
| Autor: | Shahrudin Awang Nor, Suki Arif, Omar Dakkak |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
020203 distributed computing
Computer Networks and Communications Computer science Tardiness Quality of service Distributed computing Real-time computing 02 engineering and technology Decision rule Grid computer.software_genre Tabu search Scheduling (computing) Grid computing Artificial Intelligence 0202 electrical engineering electronic engineering information engineering computer Software |
| Zdroj: | Journal of Computer Science. 13:105-113 |
| ISSN: | 1549-3636 |
| Popis: | Due to the heterogeneity and complexity in grid computing, classical 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 deteriorates the performance of the scheduler. Thus, a policy that can handle the dynamicity efficiently is indispensable. This paper presents the Swift Gap mechanism (SG), which is a hybridization of the Best Gap mechanism, alongside with Tabu search (BGT). 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), especially for a slowdown, tardiness, waiting time and response time. Moreover, an evaluation of the new proposed mechanism Swift Gap is provided. From the evaluation, Swift Gap outperforms BGT, Conservative Backfilling (CONS) and Extensible Argonne Scheduling System (EASY). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|