Date: 17 Nov 2006

Delays in asynchronous communication domain decomposition

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper addresses the problem of estimating the total execution time of a parallel program based on a domain decomposition strategy.

We consider the situation where a single iteration on each processor can take two different execution times. We show that the total time depends on the topology of the interconnection network and provide a lower bound for the ring and the grid.

The analysis is supported further by a set of simulations and comparisons of specific cases.