Applying Processes Rescheduling over Irregular BSP Application

  • Authors:
  • Rodrigo Rosa Righi;Laércio Lima Pilla;Alexandre Silva Carissimi;Philippe O. Navaux;Hans-Ulrich Heiss

  • Affiliations:
  • Instituto de Informática, Federal University of Rio Grande do Sul, Brazil;Instituto de Informática, Federal University of Rio Grande do Sul, Brazil;Instituto de Informática, Federal University of Rio Grande do Sul, Brazil;Instituto de Informática, Federal University of Rio Grande do Sul, Brazil;Kommunikations- und Betriebssysteme, Technical University Berlin, Germany

  • Venue:
  • ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper shows an evaluation of processes rescheduling over an irregular BSP (Bulk Synchronous Parallel) application. Such application is based on dynamic programming and its irregularity is presented through the variation of computation density along the matrix' cells. We are using MigBSP model for processes rescheduling, which combines multiple metrics - Computation, Communication and Memory - to decide about processes migration. The main contribution of this paper includes the viability to use processes migration on irregular BSP applications. Instead to adjust the load of each process by hand, we presented that automatic processes rebalancing is an effortless technique to obtain performance. The results showed gains greater than 10% over our multi-cluster architecture. Moreover, an acceptable overhead from MigBSP was observed when no migrations happen during application execution.