Improving Metaheuristics for Mapping Independent Tasks into Heterogeneous Memory-Constrained Systems

Authors:
Javier Cuenca;Domingo Giménez
Affiliations:
Departamento de Ingeniería y Tecnología de Computadores, Universidad de Murcia, Murcia, Spain 30071;Departamento de Informática y Sistemas, Universidad de Murcia, Murcia, Spain 30071
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 7
Cited 0

Algorithmics for Hard Problems

Algorithmics for Hard Problems
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids

PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition)

Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition)
Off-Line and On-Line Scheduling on Heterogeneous Master-Slave Platforms

PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
Scheduling Algorithms

Scheduling Algorithms
A proposal of metaheuristics to schedule independent tasks in heterogeneous memory-constrained systems

CLUSTER '07 Proceedings of the 2007 IEEE International Conference on Cluster Computing
A unified view on hybrid metaheuristics

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows different strategies for improving some metaheuristics for the solution of a task mapping problem. Independent tasks with different computational costs and memory requirements are scheduled in a heterogeneous system with computational heterogeneity and memory constraints. The tuned methods proposed in this work could be used for optimizing realistic systems, such as scheduling independent processes onto a processors farm.