Home // INFOCOMP 2011, The First International Conference on Advanced Communications and Computation // View article

Self-Organizing the Selection of Migratable Processes on Cluster-of-Clusters Environments

Authors:
Rodrigo Righi
Lucas Graebin
Rafael Ávila
Philippe Navaux
Laercio Pilla

Keywords: BSP, rescheduling, heuristic, self-organizing

Abstract:
The decision to move processes to new resources is NP-Hard, and heuristics take place in order to reach good results inside an acceptable time interval. In this way, this paper presents AutoMig — a novel heuristic for BSP applications that self-organizes the selection of candidates for migration on different clusters. Its differential approach consists in a predic- tion function (pf) that considers both processes’ computation and communication data as well as their migration costs. pf is applied over a list of schedules and AutoMig’s final step decides whether one of them outperforms the time of the current mapping. The results emphasize gains up to 32% when testing a CPU-bound application in a simulated cluster-of-clusters environment. Besides AutoMig, this paper also describes the rescheduling model associated with it.

Pages: 131 to 136

Copyright: Copyright (c) IARIA, 2011

Publication date: October 23, 2011

Published in: conference

ISSN: 2308-3484

ISBN: 978-1-61208-161-8

Location: Barcelona, Spain

Dates: from October 23, 2011 to October 29, 2011