Dynamic Job Scheduling on the Grid Environment using the Great Deluge Algorithm

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

11 Citations (Scopus)


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 compute-intensive 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.
Original languageEnglish
Title of host publication Parallel Computing Technologies
Number of pages10
Publication statusPublished - Sept 2007
Event9th International Conference on Parallel Computing Technologies - Pereslavl-zalessky, Russian Federation
Duration: 01 Sept 200701 Sept 2007

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conference9th International Conference on Parallel Computing Technologies
Country/TerritoryRussian Federation


Dive into the research topics of 'Dynamic Job Scheduling on the Grid Environment using the Great Deluge Algorithm'. Together they form a unique fingerprint.

Cite this