Search results

1 – 2 of 2
Article
Publication date: 7 November 2016

Diogo Tenório Cintra, Ramiro Brito Willmersdorf, Paulo Roberto Maciel Lyra and William Wagner Matos Lira

The purpose of this paper is to present a methodology of hybrid parallelization applied to the discrete element method that combines message-passing interface and OpenMP to…

Abstract

Purpose

The purpose of this paper is to present a methodology of hybrid parallelization applied to the discrete element method that combines message-passing interface and OpenMP to improve computational performance. The scheme is based on mapping procedures based on Hilbert space-filling curves (HSFC).

Design/methodology/approach

The methodology uses domain decomposition strategies to distribute the computation of large-scale models in a cluster. It also partitions the workload of each subdomain among threads. This additional procedure aims to reach higher computational performance by adjusting the usage of message-passing artefacts and threads. The main objective is to reduce the communication among processes. The work division by threads employs HSFC in order to improve data locality and to avoid related overheads. Numerical simulations presented in this work permit to evaluate the proposed method in terms of parallel performance for models that contain up to 3.2 million particles.

Findings

Distinct partitioning algorithms were used in order to evaluate the local decomposition scheme, including the recursive coordinate bisection method and a topological scheme based on METIS. The results show that the hybrid implementations reach better computational performance than those based on message passing only, including a good control of load balancing among threads. Case studies present good scalability and parallel efficiencies.

Originality/value

The proposed approach defines a configurable execution environment for numerical models and introduces a combined scheme that improves data locality and iterative workload balancing.

Details

Engineering Computations, vol. 33 no. 8
Type: Research Article
ISSN: 0264-4401

Keywords

Article
Publication date: 7 November 2016

Diogo Tenório Cintra, Ramiro Brito Willmersdorf, Paulo Roberto Maciel Lyra and William Wagner Matos Lira

The purpose of this paper is to present a methodology for parallel simulation that employs the discrete element method (DEM) and improves the cache performance using Hilbert space…

Abstract

Purpose

The purpose of this paper is to present a methodology for parallel simulation that employs the discrete element method (DEM) and improves the cache performance using Hilbert space filling curves (HSFC).

Design/methodology/approach

The methodology is well suited for large-scale engineering simulations and considers modelling restrictions due to memory limitations related to the problem size. An algorithm based on mapping indexes, which does not use excessive additional memory, is adopted to enable the contact search procedure for highly scattered domains. The parallel solution strategy uses the recursive coordinate bisection method in the dynamical load balancing procedure. The proposed memory access control aims to improve the data locality of a dynamic set of particles. The numerical simulations presented here contain up to 7.8 millions of particles, considering a visco-elastic model of contact and a rolling friction assumption.

Findings

A real landslide is adopted as reference to evaluate the numerical approach. Three-dimensional simulations are compared in terms of the deposition pattern of the Shum Wan Road landslide. The results show that the methodology permits the simulation of models with a good control of load balancing and memory access. The improvement in cache performance significantly reduces the processing time for large-scale models.

Originality/value

The proposed approach allows the application of DEM in several practical engineering problems of large scale. It also introduces the use of HSFC in the optimization of memory access for DEM simulations.

Details

Engineering Computations, vol. 33 no. 8
Type: Research Article
ISSN: 0264-4401

Keywords

1 – 2 of 2