Simulated Annealing for Grid Scheduling Problem

Authors:
Stefka Fidanova
Affiliations:
Institute of Parallel Processing-BAS, Acad. G. Bonchev str. Bl. 25A, 1113 Sofia, Bulgaria
Venue:
JVA '06 Proceedings of the IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing
Year:
2006

Citing 0
Cited 7

The Grid as a Single Entity: Towards a Behavior Model of the Whole Grid

OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
An Awareness-Based Simulated Annealing Method to Cover Dynamic Load-Balancing in Collaborative Distributed Environments

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
A survey on grid task scheduling

International Journal of Computer Applications in Technology
Dynamic job scheduling on the grid environment using the great deluge algorithm

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
A bio-inspired distributed algorithm to improve scheduling performance of multi-broker grids

Natural Computing: an international journal
Self Adaptive Particle Swarm Optimization for Efficient Virtual Machine Provisioning in Cloud

International Journal of Intelligent Information Technologies
Scheduling algorithms for real-time computing systems admitting simulation models

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographically dispersed organizations. The goal of grid tasks scheduling is to achieve high system throughput and to match the application need with the available computing resources. This is matching of resources in a non-deterministically shared heterogeneous environment. The complexity of scheduling problem increases with the size of the grid and becomes highly difficult to solve effectively. To obtain good methods to solve this problem a new area of research is implemented. This area is based on developed heuristic techniques that provide an optimal or near optimal solution for large grids. In this paper we introduce a tasks scheduling algorithm for grid computing. The algorithm is based on simulated annealing method. The paper shows how to search for the best tasks scheduling for grid computing.