Mapping in heterogeneous systems with heuristic methods

Authors:
Juan-Pedro Martínez-Gallar;Francisco Almeida;Domingo Giménez
Affiliations:
Departamento de Estadística, Matemáticas e Informática, Universidad Miguel Hernández, Alicante, Spain;EIOC-ULL, Edificio Física-Matemáticas, La Laguna, Spain;Universidad de Murcia, Departamento de Informática y Sistemas, Murcia, Spain
Venue:
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Year:
2006

Citing 11
Cited 1

Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints

Journal of Systems and Software
Introduction to algorithms

Introduction to algorithms
Fundamentals of algorithmics

Fundamentals of algorithmics
Heterogeneous distribution of computations solving linear algebra problems on networks of heterogeneous computers

Journal of Parallel and Distributed Computing
Algorithmics for Hard Problems

Algorithmics for Hard Problems
BDD Variable Ordering by Scatter Search

ICCD '01 Proceedings of the International Conference on Computer Design: VLSI in Computers & Processors
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms

IEEE Transactions on Parallel and Distributed Systems
Mapping and Load-Balancing Iterative Computations

IEEE Transactions on Parallel and Distributed Systems
Pipelines on heterogeneous systems: models and tools: Research Articles

Concurrency and Computation: Practice & Experience
Heuristics for work distribution of a homogeneous parallel dynamic programming scheme on heterogeneous systems

Parallel Computing - Heterogeneous computing

A framework for the application of metaheuristics to tasks-to-processors assignation problems

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.