Parallel discrete element simulation of poly-dispersed granular material

Kačianauskas, Rimantas; Maknickas, Algirdas; Kačeniauskas, Arnas; Markauskas, Darius; Balevičius, Robertas

doi:10.1016/j.advengsoft.2008.12.004

Cited by 62 publications

(31 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two main ideas have been exploited to achieve this parallelism [32]. The first method is called atom decomposition of the workload, since the processor computes forces on its particles no matter where they move in the simulation domain because the assignment remains fixed for the duration of the simulation.…”

Section: Domain Decompositionmentioning

confidence: 99%

Evaluating the performance of the particle finite element method in parallel architectures

2014

View full text Add to dashboard Cite

This paper presents a high performance implementation for the particle-mesh based method called particle finite element method two (PFEM-2). It consists of a material derivative based formulation of the equations with a hybrid spatial discretization which uses an Eulerian mesh and Lagrangian particles. The main aim of PFEM-2 is to solve transport equations as fast as possible keeping some level of accuracy. The method was found to be competitive with classical Eulerian alternatives for these targets, even in their range of optimal application. To evaluate the goodness of the method with large simulations, it is imperative to use of parallel environments. Parallel strategies for Finite Element Method have been widely studied and many libraries can be used to solve Eulerian stages of PFEM-2. However, Lagrangian stages, such as streamline integration, must be developed considering the parallel strategy selected. The main drawback of PFEM-2 is the large amount of memory needed, which limits its application to large problems with only one computer. Therefore, a distributed- memory implementation is urgently needed. Unlike a sharedmemory approach, using domain decomposition the memory is automatically isolated, thus avoiding race conditions; however new issues appear due to data distribution over the processes. Thus, a domain decomposition strategy for both particle and mesh is adopted, which minimizes the communication between processes. Finally, performance analysis running over multicore and multinode architectures are presented. The Courant-Friedrichs-Lewy number used influences the efficiency of the parallelization and, in some cases, a weighted partitioning can be used to improve the speed-up. However the total cputime for cases presented is lower than that obtained when using classical Eulerian strategies.

show abstract

Section: Domain Decompositionmentioning

confidence: 99%

Evaluating the performance of the particle finite element method in parallel architectures

2014

View full text Add to dashboard Cite

show abstract

“…If a classical MD approach is used, we have no solver and the main effort has to be done on the contact detection phase, see [27,31] for instance. In this case the partitioning phase has to be parallelized to optimize the load balance of the processors only if a domain decomposition strategy is performed [23]. Since we use large time steps with the NSCD approach for simulating granular systems involving moreover a stable connectivity, we focus on the parallelization of a solver which combines the generic NSCD solver identified to a non linear Gauss Seidel algorithm [22,33] (NLGS) and a domain decomposition method (DDM).…”

Section: Motivationsmentioning

confidence: 99%

A domain decomposition method for granular dynamics using discrete elements and application to railway ballast

Hoang

Alart

Dureisseix

et al. 2011

Ann. Solid Struct. Mech.

View full text Add to dashboard Cite

The paper is devoted to the development of a non overlapping domain decomposition method suited to granular dynamics. The formulation and the efficiency of such a method are well established for structural mechanics. In order to extend this approach to granular systems a so-called primal splitting of the domain is chosen because it is a less intrusive method for software development.Once the interface problem is defined and the solver is slightly enriched with some extra numerical parameters, the method is tested on railway ballast simulations for improving the maintenance of railway tracks. Mathematics Subject ClassificationThe simulation of more and more realistic granular media leads to intensive computations. The size of the simulation increases both in term of number of bodies or particles and of duration of the process to be simulated. The increase of the computations concerns then both the space and the time, because a granular system often exhibits a complex dynamic behavior. Indeed dense collections of grains subjected to dynamic loadings require large-scale samples simulated on a long time to capture the local dynamic crises responsible of the global behavior of the system. Many applications involve such dense assemblies as the sand piles, dunes, blocky rocks, powders. We are here specially interested in a class of applications for which the connectivity of the grains remains almost stable during the studied process, as the masonry of monuments (before collapse) or the railway ballast.The denominations of 'discrete element methods' and 'distinct element methods' (DEM) are commonly used to refer to the pioneering approach of Cundall [11], today implemented in a large range of commercial pieces of software intended to handle non-interpenetrability. Also, because the computation techniques applied in such implementations are close to those of molecular simulations, the denomination of 'molecular dynamics' (MD) method is also used, specially in the domain of granular mechanics [16]. Such an approach is based on regularization strategies both for the dynamics and the interactions between grains. First, the non-interpenetrability constraints are replaced by some stiff 'elastic' repulsion laws which

show abstract

“…VizLitG is very useful for LitGrid users performing large distributed computations of significant problems such as sediment transport, dam break, nano-powders, compacting, mixing and hopper discharge [34,35]. Particle systems are considered as a pilot application for visualization due to a large number of particles that are employed modelling actual industrial applications.…”

Section: A Description Of a Benchmark Problemmentioning

confidence: 99%

“…Particle systems have no permanent connections or a usual grid that can be applied for visualization purposes because Discrete Element computations are based on particle positions, the forces acting between the particles and Newton's laws. Visualization of the tri-axial compaction problem [35] of poly-dispersed particle systems (Fig. 5) is considered for performance analysis of VizLitG.…”

Section: A Description Of a Benchmark Problemmentioning

confidence: 99%

VizLitG: Grid Visualization e-Service Enabling Partial Dataset Transfer from Storage Elements of gLite-based Grid Infrastructure

Kačeniauskas

Pacevič

2011

J Grid Computing

Self Cite

View full text Add to dashboard Cite

Grid visualization e-service VizlitG is developed for Lithuanian grid infrastructure based on gLite middleware. The client-server architecture of the e-service VizLitG is based on widely recognized web standards implemented in Java EE 6 platform and GlassFish application server. VizLitG is designed for convenient access and interactive visualization of remote data files located in storage elements of gLite-based grid infrastructure. Partial dataset transfer from the experimental storage element is developed in order to reduce the communication time and achieve interactive rates. The performance of VizLitG is evaluated visualizing poly-dispersed particle systems of different sizes in a geographically distributed grid. The attention is focused on the performance of data transfer from the storage elements and its contribution to the total benchmark time. Different types of software are employed for data transfer in order to present the quantitative comparison.

show abstract

Parallel discrete element simulation of poly-dispersed granular material

Cited by 62 publications

References 38 publications

Evaluating the performance of the particle finite element method in parallel architectures

Evaluating the performance of the particle finite element method in parallel architectures

A domain decomposition method for granular dynamics using discrete elements and application to railway ballast

VizLitG: Grid Visualization e-Service Enabling Partial Dataset Transfer from Storage Elements of gLite-based Grid Infrastructure

Contact Info

Product

Resources

About