Accelerating Numerical Ice Engineering Tools Using GPGPU
Bibliographic record
Abstract
Abstract C-CORE is engaged in understanding the iceberg and sea ice design loads needs of the energy sector. As the energy industry ventures into oceans with greater ice cover and more icebergs, there is a significant need for efficient engineering tools to plan and manage operations in exploration, production, and safety. Industry requires a range of scenarios for their risk assessments, where existing simulations can be computationally and time intensive. C-CORE has recently started using the benefit of the General Purpose Computing on Graphical Processing Units (GPGPU) approach. This approach has shown significant speed up of several numerical ice engineering applications related to icebergs and sea ice. The investigated model types are Monte-Carlo type approaches for probabilistic design method, and quadratic discriminant. GPU computing with Compute Unified Device Architecture (CUDA) is a new approach to solve complex problems and transform the GPU into a massively parallel processor. The present study applies the GPGPU technology to a Monte-Carlo simulation, used for a sea ice load application. The objective of this study is to measure the performance of the GPU using CUDA, and compare against the serial Central Processing Unit (CPU) using C++ and MATLAB implementations. Results show a speedup of up to 2,600 times of the GPGPU implementation compared to the MATLAB implementation, reducing the elapsed time from about 1.5 hour to about 2 seconds. This strongly indicates that the GPGPU approach can help the industry to significantly reduce the time required for the simulations.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 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.005 | 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".