Fast and efficient parallel coarsest refinement

DOI10.3233/FI-2017-1465MaRDI QIDQ4589607zbMATHOpenAlexFDO

Authors Nopadon Juneam, Sanpawat Kantabutra

Publication date 10 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1465

zbMATH Keywords

parallel computationpartition refinementPRAM algorithmscoarsest refinement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 4045190
• An efficient parallel algorithm for the single function coarsest partition problem
• Parallel algorithms for partitioning sorted sets and related problems
• The parallel complexity of coarsest set partition problems
• Parallel algorithms for partitioning sorted sets and related problems

Cited in

(5)

• An efficient parallel algorithm for the single function coarsest partition problem
• scientific article; zbMATH DE number 4045190 (Why is no real title available?)
• The parallel complexity of coarsest set partition problems
• An set refinement algorithm with applications
• An efficient coarse-grained parallel algorithm for global-local multiscale computations on massively parallel systems

This page was built for publication: Fast and efficient parallel coarsest refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589607)