Simple, efficient allocation of modelling runs on heterogeneous clusters with MPI. (February 2017)

• Record Type: Journal Article
• Authors: Donato, David I.
• Is Part Of: Environmental modelling & software. Volume 88(2017)
• Page Start: 48
• Page End: 57
• Publication Date: 2017-02
• Subjects: Bag of tasks -- Load balancing -- Heterogeneous cluster -- Makespan -- Message Passing Interface (MPI) -- Parallel computation -- Task allocation; Environmental monitoring -- Computer programs -- Periodicals; Ecology -- Computer simulation -- Periodicals; Digital computer simulation -- Periodicals; Computer software -- Periodicals; Environmental Monitoring -- Periodicals; Computer Simulation -- Periodicals; Environnement -- Surveillance -- Logiciels -- Périodiques; Écologie -- Simulation, Méthodes de -- Périodiques; Simulation par ordinateur -- Périodiques; Logiciels -- Périodiques; Computer software; Digital computer simulation; Ecology -- Computer simulation; Environmental monitoring -- Computer programs; Periodicals; Electronic journals; 363.70015118
• DOI: 10.1016/j.envsoft.2016.11.003
• Languages: English
• ISSNs: 1364-8152

Abstract

Abstract: In scientific modelling and computation, the choice of an appropriate method for allocating tasks for parallel processing depends on the computational setting and on the nature of the computation. The allocation of independent but similar computational tasks, such as modelling runs or Monte Carlo trials, among the nodes of a heterogeneous computational cluster is a special case that has not been specifically evaluated previously. A simulation study shows that a method of on-demand (that is, worker-initiated) pulling from a bag of tasks in this case leads to reliably short makespans for computational jobs despite heterogeneity both within and between cluster nodes. A simple reference implementation in the C programming language with the Message Passing Interface (MPI) is provided. Highlights: Simulated makespans for a special case of on-demand task allocation are studied. Makespans for on-demand task allocation are reliably short despite heterogeneity. A reference implementation in C with Message Passing Interface is provided.