Observations on Effect of IPC in GA Based Scheduling on Computational Grid

Observations on Effect of IPC in GA Based Scheduling on Computational Grid

Shiv Prakash (Jawaharlal Nehru University, India) and Deo P. Vidyarthi (Jawaharlal Nehru University, India)
Copyright: © 2012 |Pages: 14
DOI: 10.4018/jghpc.2012010105
OnDemand PDF Download:
No Current Special Offers


Computational Grid (CG) provides a wide distributed platform for high end compute intensive applications. Inter Process Communication (IPC) affects the performance of a scheduling algorithm drastically. Genetic Algorithms (GA), a search procedure based on the evolutionary computation, is able to solve a class of complex optimization problems. This paper proposes a GA based scheduling model observing the effect of IPC on the performance of scheduling in computational grid. The proposed model studies the effects of Inter Process Communication (IPC), processing rate () and arrival rate (). Simulation experiment, to evaluate the performance of the proposed algorithm is conducted and results reveal the effectiveness of the model.
Article Preview

The scheduling problem has been discussed widely in the literature (Berman et al., 2003; Foster & Kesselman, 2004; Garey & Johnson, 1979). GA is also used very frequently for solving scheduling problems as the problem is NP-Class (Tripathi et al., 2000; Vidyarthi et al., 2009). Many other models that uses GA for solving grid scheduling problems are focused in issue minimization of makespan (Abawajy, 2005; Aggarwal et al., 2005; Buyya et al., 2000; Di Martino, &, 2004; Raza & Vidyarthi, 2009b; Xhafa et al., 2007; Xhafa & Abraham, 2008).

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 14: 6 Issues (2022): 1 Released, 5 Forthcoming
Volume 13: 4 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
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