MétaCan
Menu
Back to cohort
Record W2097697106

Tough2_MP: A parallel version of TOUGH2

2003· paratext· en· W2097697106 on OpenAlexaboutno aff
Keni Zhang, Yu‐Shu Wu, Chris Ding, Karsten Pruess

Bibliographic record

VenueUniversity of North Texas Digital Library (University of North Texas) · 2003
Typeparatext
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsnot available
FundersLawrence Berkeley National LaboratoryLaboratory Directed Research and DevelopmentU.S. Department of Energy
KeywordsComputer scienceAlgorithm
DOInot available

Abstract

fetched live from OpenAlex

TOUGH2_MP is a massively parallel version of TOUGH2.It was developed for running on distributed-memory parallel computers to simulate large simulation problems that may not be solved by the standard, single-CPU TOUGH2 code.The new code implements an efficient massively parallel scheme, while preserving the full capacity and flexibility of the original TOUGH2 code.The new software uses the METIS software package for grid partitioning and AZTEC software package for linearequation solving.The standard message-passing interface is adopted for communication among processors.Numerical performance of the current version code has been tested on CRAY-T3E and IBM RS/6000 SP platforms.In addition, the parallel code has been successfully applied to real field problems of multi-million-cell simulations for threedimensional multiphase and multicomponent fluid and heat flow, as well as solute transport.In this paper, we will review the development of the TOUGH2_MP, and discuss the basic features, modules, and their applications.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Software · Consensus signal: none
Teacher disagreement score0.027
Threshold uncertainty score0.089

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0270.009

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.

Opus teacher head0.010
GPT teacher head0.182
Teacher spread0.172 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreSoftware

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".

Quick stats

Citations8
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueUniversity of North Texas Digital Library (University of North Texas)Same topicParallel Computing and Optimization TechniquesFrench-language works237,207