**Section 3**

**Advances in Grid Computing - Parallel Execution** 

22 Will-be-set-by-IN-TECH

110 Grid Computing – Technology and Applications, Widespread Coverage and New Horizons

Omar Al Jadaan, Alla Alhaffa, Wael Abdulal & Ahmad Jabas. Rank Based Genetic Algorithm

Obitko, M. (1998). http://www.obitko.com/tutorials/genetic-algorithms/

P.K. Suri & Singh Manpreet. An efficient decentralized load balancing algorithm for grid.

Prado, R. P. and Galán, S. García and Yuste, A. J. and Expósito, J. E. and Santiago, A. J. and

Ruay-Shiung Chang, Jih-Sheng Chang, & Po-Sheng Lin. An ant algorithm for balanced job

Suliman, M. O., Vellanki S.S. Kumar, & Abdulal, W. Optimization of Uncertain Construction

V. D. Martino & M. Mililotti. Scheduling in a grid computing environment using genetic

V. D. Martino. Sub Optimal Scheduling in a Grid Using Genetic Algorithms. In: *Seventeenth*

Y. Gao, H. Rong, & J. Z. Huang. Adaptive grid job scheduling with genetic algorithms. In:

Yin, Hao and Wu, Huilin and Zhou, Jiliu. An Improved Genetic Algorithm with Limited

Yun-Han Lee, Seiven Leu, &Ruay-Shiung Chang. Improving job scheduling algorithms in a

*Congress on information and Communication Technologies*, Dec. 2011.

*Symposium*, April 2002. pp. (235-239). ISBN 0-7695-1573-8.

978-1-61284-689-7, Kuala Lumpur, Malaysia.

(286–293). ISBN 978-3-642-02477-1, Berlin, Heidelberg.

978-1-4244-4790-9 , Patiala, India.

selection.php.

0167-739X.

Washington, DC, USA.

Publishers, pp. (151-161).

DC, USA.

0167-739X.

for solving the Banking ATM´s Location Problem using convolution. In: *2011 IEEE Symposium on Computers & Informatics (ISCI)*, March 2011. pp. (6–11), ISBN

In: *IEEE 2nd International Advance Computing Conference*. IEEE, pp. (10-13), ISBN

Bruque, S .Evolutionary Fuzzy Scheduler for Grid Computing. In: *Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence IWANN '09*, Springer-Verlag, pp.

scheduling in grids. In: *Future Generation Computer Systems*. Vol. 25, pp. (20-27), ISSN

Time-Cost Trade off Problem Using Simulated Annealing Algorithm. In: *World*

algorithm. In: *The 16th IEEE International Parallel and Distributed Processing*

*International Symposium on Parallel and Distributed Processing*. ftp://ftp.cs. umanitoba.ca/pub/IPDPS03, 2003, IEEE Computer Society, ISBN 0-7695-1926-1,

*Future Generation Computer Systems*, January 2005, Vol. 21, No. 1, Elsevier Science

Iteration for Grid Scheduling. In: *Sixth International Conference on Grid and Cooperative Computing*. IEEE Computer Society, pp. (221-227), ISBN 0-7695-2871-6, Washington,

grid environment. In: *Future Generation Computer Systems*. Vol. 27, pp. (991-998), ISSN

**0**

**6**

*Brazil*

**Efficient Parallel Application Execution on**

Francisco Silva1, Fabio Kon2, Daniel Batista2, Alfredo Goldman2,

The success of grid systems can be verified by the increasing number of middleware systems, actual production grids, and dedicated forums that appeared in recent years. The use of grid computing technology is increasing rapidly, reaching more scientific fields and encompassing

A grid might be seen as a way to interconnect clusters that is much more convenient than the construction of huge clusters. Another possible approach for conceiving a grid is the opportunistic use of workstations of regular users. The focus of an opportunistic grid middleware is not on the integration of dedicated computer clusters (e.g., Beowulf) or supercomputing resources, but on taking advantage of idle computing cycles of regular computers and workstations that can be spread across several administrative domains.

In a desktop grid, a large number of regular personal computers are integrated for executing large-scale distributed applications. The computing resources are heterogeneous in respect to their hardware and software configuration. Several network technologies can be used on the interconnection network, resulting in links with different capacities in respect to properties such as bandwidth, error rate, and communication latency. The computing resources can also be spread across several administrative domains. Nevertheless, from the user viewpoint, the

If the grid middleware follows an opportunistic approach, resources do not need to be dedicated for executing grid applications. The grid workload will coexist with local applications executions, submitted by the nodes regular users. The grid middleware must take advantage of idle computing cycles that arise from unused time frames of the workstations that comprise the grid. By leveraging the idle computing power of existing commodity workstations and connecting them to a grid infrastructure, the grid middleware allows a better utilization of existing computing resources and enables the execution of computationally-intensive parallel applications that would otherwise require expensive

computing system should be seen as a single integrated resource and be easy to use.

a growing body of applications (Grandinetti, 2005; Wilkinson, 2009).

**1. Introduction**

cluster or parallel machines.

**Opportunistic Desktop Grids**

Fabio Costa<sup>3</sup> and Raphael Camargo<sup>4</sup>

<sup>1</sup>*Universidade Federal do Maranhão*

<sup>2</sup>*Universidade de São Paulo* <sup>3</sup>*Universidade Federal de Goiás* <sup>4</sup>*Universidade Federal do ABC*
