Description
This article proposes hierarchal scheduling schemes for grid systems: A self-discovery scheme for the resource discovery stage and an adaptive child scheduling method for the resource selection stage. In addition, we propose three rescheduling algorithms: (1) The butterfly algorithm, which reschedules jobs when better resources become available, (2) the fallback algorithm, which reschedules jobs that had their resources taken away from the grid, before the actual resource allocation, and (3) the load-balance algorithm, which balances the load among resources. We also propose a hybrid system to combine the proposed hierarchal schemes with the well-known peer-to-peer (P2P) principle. We compare the performance of the proposed schemes against the P2P-based grid systems through simulation with respect to a set of predefined metrics.