Mapping in Heterogeneous Systems with Heuristic Methods

During recent years a large number of parallel routines and libraries have been developed. These routines have been conceived for homogeneous systems. Thanks to the evolution of technology, now it is quite usual to have heterogeneous systems. These routines and libraries need to be adapted to the new environment. There are at least two options. The routines could be rewritten, but this would be excessively costly in terms of time and money. Alternatively, the processes of a homogeneous routine can be mapped into the processors in the heterogeneous system. To do this, the development of efficient mapping techniques is necessary. Our approach to satisfactory mappings consists of modelling the execution time of the parallel routine, and obtaining the mapping that gives the minimum modelled execution time. Exact solutions to this problem are very time consumming. As an alternative, we are researching the application of heuristic techniques to solve this problem. This paper analyzes how Scatter Search can be applied to parallel iterative schemes.

[1]  Larry Carter,et al.  Scheduling strategies for master-slave tasking on heterogeneous processor platforms , 2004, IEEE Transactions on Parallel and Distributed Systems.

[2]  Jack Dongarra,et al.  High Performance Computing for Computational Science - VECPAR 2004, 6th International Conference, Valencia, Spain, June 28-30, 2004, Revised Selected and Invited Papers , 2005, VECPAR.

[3]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[4]  Francisco Almeida,et al.  The master-slave paradigm on heterogeneous systems: A dynamic programming approach for the optimal mapping , 2006, J. Syst. Archit..

[5]  Yves Robert,et al.  Mapping and load-balancing iterative computations , 2004, IEEE Transactions on Parallel and Distributed Systems.

[6]  Jens Gottlieb,et al.  Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.

[7]  Francisco Almeida,et al.  Pipelines on heterogeneous systems: models and tools , 2005, Concurr. Pract. Exp..

[8]  Krithi Ramamritham,et al.  Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints , 1987, J. Syst. Softw..

[9]  Gilles Brassard,et al.  Fundamentals of algorithms , 1996 .

[10]  Alexey L. Lastovetsky,et al.  Heterogeneous Distribution of Computations Solving Linear Algebra Problems on Networks of Heterogeneous Computers , 2001, J. Parallel Distributed Comput..

[11]  Satoshi Fujita,et al.  A fast branch-and-bound scheme for the multiprocessor scheduling problem with communication time , 2003, 2003 International Conference on Parallel Processing Workshops, 2003. Proceedings..

[12]  Javier Cuenca,et al.  Heuristics for work distribution of a homogeneous parallel dynamic programming scheme on heterogeneous systems , 2004, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks.

[13]  Johann Dréo,et al.  Metaheuristics for Hard Optimization: Methods and Case Studies , 2005 .

[14]  Xiaoyu Song,et al.  BDD variable ordering by scatter search , 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.

[15]  Juraj Hromkovic,et al.  Algorithmics for Hard Problems , 2002, Texts in Theoretical Computer Science An EATCS Series.

[16]  Javier Cuenca,et al.  Processes Distribution of Homogeneous Parallel Linear Algebra Routines on Heterogeneous Clusters , 2005, 2005 IEEE International Conference on Cluster Computing.

[17]  P. Sadayappan,et al.  Scheduling of Parallel Jobs in a Heterogeneous Multi-site Environement , 2003, JSSPP.

[18]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[19]  B. Wilkinson,et al.  A state-wide senior parallel programming course , 1999 .

[20]  Melquíades Pérez Pérez,et al.  On the Use of Path Relinking for the rho-Hub Median Problem , 2004, EvoCOP.

[21]  Lars Lundberg,et al.  Optimal Scheduling Results for Parallel Computing , 1996, Applications on Advanced Architecture Computers.

[22]  George Karypis,et al.  Introduction to Parallel Computing Solution Manual , 2003 .

[23]  Juraj Hromkovic,et al.  Algorithmics for Hard Problems , 2004, Texts in Theoretical Computer Science. An EATCS Series.