**13. References**


20 Will-be-set-by-IN-TECH

Other benefits of MSA algorithm include robustness and scalability features. the disadvantage of MSA algorithm is that flowtime is higher more than Min-Min, RGSGCS, and GANoX.

It can be concluded that MSA algorithm is a powerful technique to solve problem of minimizing makespan in grid environment with less time to be consumed by the intended

A. A. P. Kazem, A. M. Rahmani, & H. H. Aghdam. A modified simulated annealing algorithm

Abdulal, W., Jadaan, O. A, Ahmad Jabas, A. & S. Ramachandram. Genetic algorithm for grid

Abdulal, W., Jabas, A., Jadaan, O. A. & S. Ramachandram. An improved rank-based

Abdulal, W., Jadaan, A. O., Jabas, A., Ramachandram, S., Kaiiali M. & C.R. Rao. Rank-based

Abdulal, W. & S. Ramachandram. Reliability-Aware Genetic Scheduling Algorithm in Grid

Abdulal, W., Jadaan, O. A., Jabas, A.& S. Ramachandram. Mutation Based Simulated

2011, Vol. 6. pp. (90-94), IEEE, ISBN 978-1-4244-8679-3, Kanyakumari, India. Abdulal, W., Jadaan, o. A., Jabas, A. & S. Ramachandram. Rank based genetic scheduler for

Abraham, A., Rajkumar Buyya & Baikunth Nath. Nature's heuristics for scheduling jobs on

Akella, P. http://www.ecs.umass.edu/ece/labs/vlsicad/ece665/slides/

Braun, Tracy D. and Siegel, Howard Jay and Beck, Noah and Bölöni, Lasislau L. and

*Computing*. June 2001, pp. (810-837), ISSN 0743-7315.

for static task scheduling in grid computing. In: *The International Conference on Computer Science and Information Technology*, September 2008, pp. (623-627), IEEE,

scheduling using best rank power. In: *IEEE Nature & Biologically Inspired Computing (NaBIC 2009)*, December 2009, pp. (181-186), IEEE, ISBN 978-1-4244-5053-4,

genetic algorithm with limited iterations for grid scheduling. In: *IEEE Symposium on Industrial Electronics and Applications (ISIEA2009)*, October 2009, pp. (215-220), IEEE,

genetic algorithm with limited iterations for grid scheduling. In: *The First IEEE International Conference on Computational Intelligence, Communication Systems, and Networks (CICSyN2009)*, July 2009. pp. (29-34), ISBN 978-0-7695-3743-6, Indore, India.

Environment. In: *IEEE International Conference on Communication Systems and Network Technologies*, June 2011, pp. (673-677), IEEE, ISBN 978-0-7695-4437-3/11, Katra,

Annealing Algorithm for Minimizing Makespan in Grid Computing Systems. In: *IEEE International Conference on Network and Computer Science (ICNCS 2011)*. April

grid computing systems. In: *IEEE International Conference on Computational Intelligence and Communication Networks (CICN2010)*, Nov. 2010, pp. (644-649), IEEE, ISBN

computational grids. In: *8th IEEE International Conference on Advanced Computing and Communications (ADCOM2000)*. www.buyya.com/papers/nhsjcg.pdf, pp.

Maheswaran, Muthucumara and Reuther, Albert I. and Robertson, James P. and Theys, Mitchell D. and Yao, Bin and Hensgen, Debra and Freund, Richard F. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems, In: *Journal of Parallel Distributing*

algorithm.

**13. References**

ISBN 978-0-7695-3308-7, Singapore.

ISBN 978-1-4244-4681-0. Kuala Lumpur, Malaysia.

Coimbatore, India.

Jammu, India.

(45-52).

978-1-4244-8653-3, Bhopal, India.

SimulatedAnnealing.ppt.


**Section 3** 

**Parallel Execution** 

**Advances in Grid Computing -** 

