High performance multi-platform computing for large-scale image-based finite element modeling of bone
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Image-based finite element (FE) modeling of bone is a non-invasive method to estimate bone stiffness and strength. High-resolution imaging data as input allows for inclusion of bone microarchitecture but results in large amounts of data unsuitable for traditional FE solvers. Bone-specific mesh-free solvers have been developed over the past 20 years to improve on memory efficiency in simulated bone loading applications. The objective of this study was to provide linear performance benchmarking for a bone-specific, mesh-free solver (FAIM) using µCT and HR-pQCT image data on Mac, Linux, and Windows operating systems using both single- and multi-thread CPU and GPU processing. The focus is on the linear gradient-descent solver using standardized uniaxial loading of bone models from µCT, and first- and second-generation HR-pQCT scans of the radius and tibia. Convergence, speedup, memory, and batch performance tests were completed using CPUs and GPUs on three laboratory-based systems with Windows, Linux, and Mac operating systems. Although varying by system and model size, time-per-iteration was as low as 0.03 s when an HR-pQCT-based radius model (6.45 million DOF) was solved with 3 GPUs. Strong scaling was achieved with GPU and CPU parallel processing, with strong parallel efficiencies when models were solved using 3 GPUs or ≤ 10 CPU threads. Errors in force, strain energy density, and Von Mises stress were as low as 0.1% when a convergence tolerance of 10−3 or smaller was used. The results of this study indicate that to maximize computational efficiency and minimize model solution times using FAIM software under the standardized tested conditions using µCT, XCT1 and XCT2 HR-pQCT image data, convergence tolerance set to 10−4, and 10 threads or 2 GPUs are sufficient for efficient solution times. Less strict convergence tolerances will improve solution times but will introduce more error in the outcome measures.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it