SPA-based task scheduling for hypercubic P2P grid systems. (1st January 2012)

• Record Type: Journal Article
• Authors: Miriam, D. Doreen Hephzibah; Easwarakumar, K.S.
• Is Part Of: International journal of communication networks and distributed systems. Volume 9:Number 1/2(2012)
• Page Start: 117
• Page End: 139
• Publication Date: 2012-01-01
• Subjects: peer-to-peer -- grid -- hypercube -- task scheduling -- set pair analysis -- SPA -- distributed systems; Computer networks -- Periodicals; Telecommunication systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; 004.6
• Languages: English
• ISSNs: 1754-3916

Abstract

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 a well organised system architecture to provide high system availability with resource scheduling scheme for grid environment. In this paper, we integrate grid with P2P on to the hypercube topology with additional neighbourhood links for task scheduling and load balancing, which gives better makespan and balances the load. We propose the SPA-based task scheduling methodology in order to enhance system performance in hypercubic P2P grid (HPGRID). The simulation results show that the SPA-based min-mean scheduling minimises the makespan along with load balancing and guarantees the high system availability in system performance. At last, the min-mean algorithm is compared with min-min and max-min algorithm using SPA, by simulate experimentation, and it shows that the new algorithm has a better quality of system load balancing and the utilisation of system resources.