Pith. sign in

REVIEW

Parallelised Hoshen-Kopelman algorithm for lattice-Boltzmann simulations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1405.1931 v2 pith:CKMTOJKM submitted 2014-05-08 physics.comp-ph cond-mat.soft

Parallelised Hoshen-Kopelman algorithm for lattice-Boltzmann simulations

classification physics.comp-ph cond-mat.soft
keywords algorithmlattice-boltzmannsimulationslatticecommonconnecteddiscusshoshen-kopelman
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We discuss two topics that we have encountered in our lattice-Boltzmann simulations of complex fluids: the sizes of droplets in particle-stabilised emulsions and deformable particles in fluid flow. The common factor in these seemingly disparate subjects is that both represent an opportunity for a novel application of the Hoshen-Kopelman algorithm. This algorithm is based on detecting connected clusters on a lattice and labelling the involved lattice sites such that all sites that are connected share the same label. The assumption of the presence of a lattice makes it a convenient algorithm to use in combination with lattice-Boltzmann simulations. In order to apply this algorithm on the fly during massively parallel simulations, it needs to be parallelised as well. We present our parallel implementation, which is tailored to a common parallelisation scheme for the lattice-Boltzmann method, and compare it to previous work. We then briefly discuss some examples of results obtained using this procedure.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.