% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@INPROCEEDINGS{Sutmann:868011,
author = {Sutmann, Godehard},
title = {{M}ulti-{L}evel {L}oad {B}alancing for {P}arallel
{P}article {S}imulations},
address = {Barcelona, Spain},
publisher = {International Centre for Numerical Methods in Engineering
(CIMNE)},
reportid = {FZJ-2019-06604},
isbn = {978-84-121101-1-1},
pages = {80 - 92},
year = {2019},
abstract = {Ideas from multi-level relaxation methods are combined with
loadbalancing techniques to achieve a convergence
acceleration for a homogeneous workload distribution over a
given set of processors when the underlying workfunction is
inhomogeneously distributed in space. The algorithm is based
on an orthogonal recursive bisection approach which is
evaluated via a hierarchically refined coarse
integration.The method only requires a minimal information
transfer across processors during the tree traversal steps.
It is described of how to partition the system of processors
to geometrical space, when global information is needed for
the spatial tesselation.},
month = {Oct},
date = {2019-10-28},
organization = {VI International Conference on
Particle-based Methods–Fundamentals
and Applications, Barcelona (Spain), 28
Oct 2019 - 30 Oct 2019},
cin = {JSC},
cid = {I:(DE-Juel1)JSC-20090406},
pnm = {511 - Computational Science and Mathematical Methods
(POF3-511)},
pid = {G:(DE-HGF)POF3-511},
typ = {PUB:(DE-HGF)8 / PUB:(DE-HGF)7},
url = {https://juser.fz-juelich.de/record/868011},
}