Research Article
Hybrid Scheduling Model for Independent Grid Tasks
Algorithm 1
BG_ATC algorithm (BG_ATC).
STEP 1: Initialization | TASK | Schedule . | = MAX, = MAX | = Number of Idle CPU cycles | | = Null; | Pos = Null; | STEP 2: On arrival of new task | PHASE - I | IF ( is new task) | Compute Ranking Index | | Place task in a position such that | () | STEP 3: When Resource found | While ( != NULL) | Is ( is executable in ) | PHASE - II | Is Gap exists in | = index of | = Best Gap in | IF (N == 0) | GOTO Next schedule | IF (N == 1) | Place in that Gap | Calculate | If () | ; | IF (N ≥ 2) | Place task at each | Calculate | IF () | = | | Pos = ; | Else | Repeat STEP 3 |
|