Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
Journal of Computational Physics
The grid
Future Generation Computer Systems - Special issue on metacomputing
Journal of Parallel and Distributed Computing
Experiments with Scheduling Using Simulated Annealing in a Grid Environment
GRID '02 Proceedings of the Third International Workshop on Grid Computing
A metaheuristic approach to scheduling workflow jobs on a Grid
Grid resource management
The GrADS Project: Software Support for High-Level Grid Application Development
International Journal of High Performance Computing Applications
Simulated Annealing for Grid Scheduling Problem
JVA '06 Proceedings of the IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing
An Extended Implementation of the Great Deluge Algorithm for Course Timetabling
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Design optimization with chaos embedded great deluge algorithm
Applied Soft Computing
A hybrid metaheuristic approach to the university course timetabling problem
Journal of Heuristics
Hi-index | 0.00 |
The utilization of the computational Grid processor network has become a common method for researchers and scientists without access to local processor clusters to avail of the benefits of parallel processing for computeintensive applications. As a result, this demand requires effective and efficient dynamic allocation of available resources. Although static scheduling and allocation techniques have proved effective, the dynamic nature of the Grid requires innovative techniques for reacting to change and maintaining stability for users. The dynamic scheduling process requires quite powerful optimization techniques, which can themselves lack the performance required in reaction time for achieving an effective schedule solution. Often there is a trade-off between solution quality and speed in achieving a solution. This paper presents an extension of a technique used in optimization and scheduling which can provide the means of achieving this balance and improves on similar approaches currently published.