A hierarchical and distributed approach for mapping large applications to heterogeneous grids using genetic algorithms
Authors:
- Sajal K. DasSDSajal K. Das
- Rupak BiswasRBRupak Biswas
- 1 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 496-499
Abstract
In this paper, we propose a distributed approach for mapping a single large application to a heterogeneous grid environment. To minimize the execution time of the parallel application, we distribute the mapping overhead to the available nodes of the grid. This approach not only provides a fast mapping of tasks to resources but is also scalable. We adopt a hierarchical grid model and accomplish the job of mapping tasks to this topology using a scheduler tree. Results show that our three-phase algorithm provides high quality mappings, and is fast and scalable.Keywords
This publication has 5 references indexed in Scilit:
- On Advantages of Grid Computing for Parallel Job Scheduling2003
- Clustering and reassignment-based mapping strategy for message-passing architectures2002
- Graph partitioning for parallel applications in heterogeneous Grid environments2002
- Scheduling in a grid computing environment using genetic algorithms2002
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001