A novel approach for QoS guided metascheduler for hypercubic P2P grid system
by D. Doreen Hephzibah Miriam; K.S. Easwarakumar
International Journal of Innovative Computing and Applications (IJICA), Vol. 4, No. 1, 2012

Abstract: Task scheduling is an integrated component of computing. One of the goals of P2P grid task scheduling is to achieve high system throughput while matching application needs with the available computing resources. This matching of resources in a non-deterministically shared heterogeneous environment leads to concerns over quality of service (QoS). In this paper, we integrate grid with P2P onto the modified hypercube topology to propose, a novel approach for QoS guided task scheduling algorithm called QoS guided hypercubic P2P grid metascheduler (QPGM) using min mean computation algorithm. The proposed scheme gives improved performance on load balancing and generates an optimal schedule so as to complete the tasks in a minimum time and to utilise the resources efficiently. Simulation results demonstrate that QPGM task scheduling algorithm can get better effect for a large-scale optimisation problem.

Online publication date: Wed, 17-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com