A Double Min Min Algorithm for Task Metascheduler on Hypercubic P2P Grid Systems
Most of the existing solutions on task scheduling and resource
management in grid computing are based on the traditional
client/ server model, enforcing a homogeneous policy on making
decisions and limiting the flexibility, unpredictable reliability
and scalability of the system. Thus, we need well organized
system architecture to provide high system availability with task
scheduling scheme for Grid system. In this paper, we integrate
Grid with P2P on to the extended Hypercube topology for task
scheduling and load balancing, which gives optimal makespan
and balances the load. We propose an efficient SPA based task
scheduling algorithm named Double Min Min Algorithm which
performs scheduling in order to enhance system performance in
Hypercubic P2P Grid (HPGRID). The simulation result shows
that the SPA based Double Min Min scheduling minimizes the
makespan with load balancing and guarantees the high system
availability in system performance. At last, the SPA based
Double Min Min algorithm is compared with traditional Min Min
and Max Min algorithm, by the experiment evaluation it shows
that the new algorithm has a better quality of system load
balancing and the utilization of system resources.
Keywords: Peer-to-Peer, Grid, Hypercube, Task Scheduling,
Min Min, Max Min, Set Pair Analysis (SPA)
Download Full-Text
