Parallel Exascale Mesh Generation by Subdivision
Bibliographic record
Abstract
Mesh generation requires substantial computational resources in terms of both CPU time and memory. Computational cost becomes especially pronounced when considering the scale of advanced industrial applications, in which mesh sizes can reach ten billion cells and growing. Examesh, introduced in 2019, aimed to develop a fast and reliable methodology for generating large-scale meshes. Presently, the software has demonstrated successful generation of 347 billion cells. However, the resulting mesh files for such large cell counts are expected to be on the order of terabytes (TB). Storing such massive mesh files is not practical. To address this challenge, we have enhanced the software’s performance by parallelizing through the integration of the Message Passing Interface (MPI) framework. This speeds up mesh generation, but perhaps more importantly generates the parallel mesh in situ, removing the requirement to store it on disk or transport it between machines. The most challenging part of parallelizing mesh generation software that we addressed in this research work is establishing topological relationships between mesh entities at the part boundaries. We successfully generated meshes in parallel with as many as hundreds of billions of cells on as many as thousands of processors.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.009 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".