Delays in asynchronous communication domain decomposition

  • Marco Dimas Gubitoso
  • Carlos HumesJr
Posters
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1593)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1999

Authors and Affiliations

  • Marco Dimas Gubitoso
    • 1
  • Carlos HumesJr
    • 1
  1. 1.Instituto de Matemática e EstatísticaUniversidade de São PauloSão PauloBrazil

Personalised recommendations