Porting CFD Codes Towards Grids: A Case Study

* Final gross prices may vary according to local VAT.

Get Access


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.