Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/12101
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGroen, D-
dc.contributor.authorAbou Chacra, D-
dc.contributor.authorNash, RW-
dc.contributor.authorJaros, J-
dc.contributor.authorBernabeu, MO-
dc.contributor.authorCoveney, PV-
dc.contributor.editorMarkidis, S-
dc.contributor.editorLaure, E-
dc.coverage.spatialStockholm, SWEDEN-
dc.coverage.spatialStockholm, SWEDEN-
dc.coverage.spatialStockholm, SWEDEN-
dc.date.accessioned2016-02-12T15:00:36Z-
dc.date.available2015-01-01-
dc.date.available2016-02-12T15:00:36Z-
dc.date.issued2015-
dc.identifier.citationInternational Conference on Exascale Applications and Software, EASC 2014, Stockholm, Sweden, (April 2-3, 2014), Lecture Notes in Computer Science, 8759, pp 28-38, (2015)en_US
dc.identifier.isbn978-3-319-15975-1-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://link.springer.com/chapter/10.1007%2F978-3-319-15976-8_2-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/12101-
dc.description.abstractObtaining a good load balance is a significant challenge in scaling up lattice-Boltzmann simulations of realistic sparse problems to the exascale. Here we analyze the effect of weighted decomposition on the performance of the HemeLB lattice-Boltzmann simulation environment, when applied to sparse domains. Prior to domain decomposition, we assign wall and in/outlet sites with increased weights which reflect their increased computational cost. We combine our weighted decomposition with a second optimization, which is to sort the lattice sites according to a space filling curve. We tested these strategies on a sparse bifurcation and very sparse aneurysm geometry, and find that using weights reduces calculation load imbalance by up to 85 %, although the overall communication overhead is higher than some of our runs.en_US
dc.description.sponsorshipThis work has received funding from the CRESTA and MAPPER projects within the EC-FP7 (ICT-2011.9.13) under Grant Agreements nos. 287703 and 261507, and from EPSRC Grants EP/I017909/1 (www.2020science.net) and EP/I034602/1.en_US
dc.format.extent28 - 38 (11)-
dc.language.isoenen_US
dc.publisherSpringer International Publishingen_US
dc.source2nd International Conference on Exascale Applications and Software (EASC)-
dc.source2nd International Conference on Exascale Applications and Software (EASC)-
dc.source2nd International Conference on Exascale Applications and Software (EASC)-
dc.subjectHigh performance computingen_US
dc.subjectLattice-Boltzmannen_US
dc.subjectDomain decompositionen_US
dc.titleWeighted decomposition in high-performance lattice-Boltzmann simulations: Are some lattice sites more equal than others?en_US
dc.typeConference Paperen_US
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-319-15976-8_2-
dc.relation.isPartOfSOLVING SOFTWARE CHALLENGES FOR EXASCALE-
pubs.finish-date2014-04-03-
pubs.finish-date2014-04-03-
pubs.finish-date2014-04-03-
pubs.publication-statusPublished-
pubs.publication-statusPublished-
pubs.publication-statusPublished-
pubs.start-date2014-04-02-
pubs.start-date2014-04-02-
pubs.start-date2014-04-02-
pubs.volume8759-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf585.45 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.