Applying Processes Migration on a BSP-Based LU Decomposition Application
Rodrigo Righi (UFRGS)Laercio Pilla (UFRGS)
Alexandre Carissimi (UFRGS)
Philippe Navaux (UFRGS)
Hans-Ulrich Heiss (TU Berlin)
Abstract:
Process migration is an useful mechanism to offer load balancing. In this
context, we developed a model called MigBSP that controls processes
rescheduling on BSP applications. MigBSP is especially pertinent to obtain
performance on this type of applications, since they are composed by
supersteps which always wait for the slowest process. In this paper, we focus
on the BSP-based modeling of the widely used LU Decomposition algorithm as
well as its execution with MigBSP. The use of multiple metrics to decide
migrations and adaptations on rescheduling frequency turn possible gains up to 19% over our cluster-of-clusters architecture. Finally, our final idea is to show the possibility to get performance in LU effortlessly by using novel migration algorithms.
Keywords:
Parallel and Distributed Computing, Performance Analysis
