Porting CFD codes towards grids: a case study

  • Authors:
  • Dana Petcu;Daniel Vizman;Marcin Paprzycki

  • Affiliations:
  • Computer Science Department, Western University;Physics Department, Western University of Timişoara, Romania;Computer Sciecne Institute, SWPS, Warsaw, Poland

  • Venue:
  • PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we discuss an application of a modified version of a graph partitioning-based heuristic load-balancing algorithm known as the Largest Task First with Minimum Finish Time and Available Communication Costs, which is a part of the EVAH package. The proposed modification takes into account the dynamic nature and heterogeneity of grid environments. The new algorithm is applied to facilitate load balance of a known CFD code used to model crystal growth.