Peer-to-Peer Desktop Grids Based on an Adaptive Decentralized Scheduling Mechanism

Peer-to-Peer Desktop Grids Based on an Adaptive Decentralized Scheduling Mechanism

H. Arafat Ali (Mansoura University, Egypt), A.I. Saleh (Mansoura University, Egypt), Amany M. Sarhan (Mansoura University, Egypt) and Abdulrahman A. Azab (Mansoura University, Egypt)
Copyright: © 2010 |Pages: 20
DOI: 10.4018/jghpc.2010092801
OnDemand PDF Download:
$37.50

Abstract

This article proposes an adaptive fuzzy logic based decentralized scheduling mechanism that will be suitable for dynamic computing environment in which matchmaking is achieved between resource requirements of outstanding tasks and resource capabilities of available workers. Feasibility of the proposed method is done via real time system. Experimental results show that implementing the proposed fuzzy matchmaking based scheduling mechanism maximized the resource utilization of executing workers without exceeding the maximum execution time of the task. It is concluded that the efficiency of FMA-based decentralized scheduling, in the case of parallel execution, is reduced by increasing the number of subtasks.
Article Preview

Introduction

Grid has recently emerged as a promising paradigm for high performance or high throughput computing because of the vast development of powerful computers and high-speed network technologies as well as low cost servers (GIMPS, 2009). Grid aims to aggregate heterogeneous, large-scale, and multiple-institutional resources, and to provide the transparent, secure, and coordinated access to various computing resources (supercomputer, cluster, scientific instruments, database, storage, etc.) owned by multiple institutions by making virtual organization. Grid computing is regarded to be the future of Semantic Web, the next step in distributed networking (SETI@home, 2009).

A peer-to-peer (or “P2P”) computer network exploits diverse connectivity between participants in a network and the cumulative bandwidth of network participants rather than conventional centralized resources where a relatively low number of servers provide the core value to a service or application. Peer-to-peer networks are typically used for connecting nodes via largely ad hoc connections. Many peer-to-peer networks are overlay networks because they run on top of the Internet. The overall goal of Peer-to-Peer (P2P) based systems is to provide (share) resources (like computing power, bandwidth or storage). A fundamental principle of the P2P paradigm is equality. P2P computing can be defined as the sharing of computer resources and services by direct exchange.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing