Dynamic Job Scheduling on the Grid Environment Using the Great Deluge Algorithm
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.
KeywordsGrid Job Scheduling Great Deluge Simulated Annealing Network Parallel Processing
Unable to display preview. Download preview PDF.
- 3.Liu, L., Zhan, J., Lian, L.: A Runtime Scheduling Approach with Respect to Job Parallelism for Computational Grid. In: Proc. Of 3rd International Conference of Grid and Cooperative Computing (2004)Google Scholar
- 4.Mika, M., et al.: A Metaheuristic Approach to Scheduling Workflow Jobs on a Grid. In: Grid Resource Management: State of the Art and Future Trends, Kluwer Academic Publishers, Boston (2003)Google Scholar
- 8.Fidanova, S.: Simulated Annealing for Grid Scheduling Problem. In: IEEE John Vincent Atanasoft International Symposium on Modern Computing (JVA 2006), pp. 41–45 (2006)Google Scholar
- 9.McMullan, P.: An Extended Implementation of the Great Deluge Algorithm for Course Timetabling. In: ICCS 2007. International Conference on Computational Science. LNCS, Springer, Heidelberg (2007)Google Scholar
- 10.Kendall, G., Mohamad, M.: Channel Assignment in Cellular Communication Using a Great Deluge Hyper-Heuristic. In: Proc. of IEEE International Conference on Network (ICON 2004), pp. 769–773 (2004)Google Scholar
- 11.Petrovic, S., Burke, E.K.: University Timetabling, Handbook of Scheduling: Algorithms, Models and Performance Analysis, ch. 45. CRC Press, Boca Raton (2004)Google Scholar
- 12.McMullan, P., Roche, T.: An Intelligent Space Allocation and Planning Tool for Educational Requirements. Technical Report, RTS-TR-2005-2 (2005)Google Scholar
- 14.Foster, I., Kesselman, C.: The Globus Toolkit. In: Foster, I., Kesselmanm, C. (eds.) The Grid: Blueprint for a New Computing Infrastructure, ch. 11, Morgan Kaufmann, San Francisco (1999)Google Scholar
- 16.Burke, E.K., Newall, J.P.: Solving Examination Timetabling Problems through Adaptation of Heuristic Orderings, Technical Report, Nottingham (2002)Google Scholar