Abstract

AbstractIn 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.KeywordsLoad BalanceGrid EnvironmentDynamic Load BalanceLoad Balance StrategyLarge TaskThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.