Parallel Computing Techniques for Large-Scale Reservoir Simulation of Multi-Component and Multiphase Fluid Flow
Bibliographic record
Abstract
Abstract Massively parallel computing techniques can overcome limitations of problem size and space resolution for reservoir simulation on single-processor machine. This paper reports on our work to parallelize a widely used numerical simulator, known as TOUGH2, for nonisothermal flows of multi-component, multiphase fluids in three-dimensional porous and fractured media. We have implemented the TOUGH2 package on a Cray T3E-900, a distributed-memory massively parallel computer with 695 processors. For the simulation of large-scale multicomponent, multiphase fluid flow, the requirements for computer memory and computing time are extensive. Because of the limitation of computer memory in each PE (processing element), we distribute not only computing time but also the memory requirement to different PEs. In this study, the METIS software package for partitioning unstructured graph and meshes is adopted for domain partitioning, and the Aztec linear solver package is used for solving linear equation systems. The efficiency of the code is investigated through the modeling of a three-dimensional variably saturated flow problem, which involves more than one million gridblocks. The execution time and speedup are evaluated through comparing the performance of different numbers of processors. The results indicate that the parallel code can significantly improve capacity and efficiency for large-scale 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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".