Applying Processes Rescheduling over Irregular BSP Application
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Applying process migration on a BSP-based LU decomposition application
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
| Hi-index | 0.01 |
We have developed a model for dynamic process scheduling in heterogeneous and non-dedicated environments. This model acts over a BSP (Bulk Synchronous Parallel) application, applying runtime processes reassignment to new processors. A BSP application is divided in one or more supersteps, each one containing both computation and communication phases followed by a barrier synchronization. In this context, the developed model combines three metrics - Memory, Computation and Communication - in order to measure the potential of migration of each BSP process. The final idea is to offer a mathematical formalism involving these metrics and to decide the following questions about the process migration: When? Where? Which? This paper presents the algorithms of our model, the parallel machine organization, some experimental results and related work.