Repartition dynamique de donnees regulieres pour des machines MIMD homogenes a memoire distribuee - Archive ouverte HAL Access content directly
Journal Articles CiteSeerx Year : 2007

Repartition dynamique de donnees regulieres pour des machines MIMD homogenes a memoire distribuee

(1) , (1)
1

Abstract

This paper reports a simple strategy for dynamically load balancing of regular data on homogeneous Distributed Memory MIMD computers with static interconnexion network. That is data in which each unit can be processed independently and requires the same time on each processor. This strategy is based upon a global knowledge of the initial distribution of the data' load obtained by a generalized prefix computation on a spanning tree of the graph of the interconnexion network of the processors; this strategy is then usable for any topology. We prove also that the data exchangesinduced by this strategy lead to the balance of the data' load in time O(min P kP kK(P )), where P is a maximum weight path of the spanning tree, kP k its length and K(P ) the maximum weight of its arcs.
Not file

Dates and versions

emse-00675089 , version 1 (29-02-2012)

Identifiers

  • HAL Id : emse-00675089 , version 1

Cite

Mihaela Juganaru-Mathieu, Ibrahima Sakho. Repartition dynamique de donnees regulieres pour des machines MIMD homogenes a memoire distribuee. CiteSeerx, 2007, pp.10.1.1.39.6074. ⟨emse-00675089⟩
73 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More