Efficient metacomputing of elliptic linear and non-linear problems

  • Authors:

  • Nicolas Barberou;Marc Garbey;Matthias Hess;Michael M. Resch;Tuomo Rossi;Jari Toivanen;Damien Tromeur-Dervout

  • Affiliations:

  • CDCSP, University of Claude Bernard Lyon-1, ISTIL-Batiment 101 43 Bd du 11 Nov 1918, 69622 Villeurbanne cedex, France;CDCSP, University of Claude Bernard Lyon-1, ISTIL-Batiment 101 43 Bd du 11 Nov 1918, 69622 Villeurbanne cedex, France and Department of Computer Science, University of Houston, 4800 Calhoun Road, ...;HLRS, University of Stuttgart, Germany;Department of Computer Science, University of Houston, 4800 Calhoun Road, Houston, TX and HLRS, University of Stuttgart, Germany;Department of Mathematical Information Technology, University of Jyväskylä, Finaland;Department of Mathematical Information Technology, University of Jyväskylä, Finaland;CDCSP, University of Claude Bernard Lyon-1, ISTIL-Batiment 101 43 Bd du 11 Nov 1918, 69622 Villeurban cedex, France

  • Venue:
  • Journal of Parallel and Distributed Computing - Special issue on computational grids
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Metacomputing is a method of using the GRID, which originated in the US and quickly was also picked up by European and Japanese researchers where a number of challenging projects were aiming at the exploitation of such distributed resources. Especially the GLOBUS project (The globus project: a status report, Proceedings IPPS/SPDP'98 Heterogeneous Computing Workshop, 1998, pp. 4-18) has contributed to the success of metacomputing substantially. However, high latency and low bandwidth have made people doubt the feasibility of this concept for big simulation codes. In this paper we present new numerical methods that help to exploit such configurations and overcome the problems of low network performance. To proof the feasibility of our approach we show results of simulations in an innovative GRID environment of supercomputers.