MétaCan
Menu
Back to cohort
Record W4416004510 · doi:10.1145/3731599.3767478

Implementing OpenMP Offload Support in the AMD Next Generation Fortran Compiler

2025· article· W4416004510 on OpenAlexaff
Dominik Adamski, Sergio Afonso, A. Banerjee, Pranav Bhandarkar, Kareem Ergawy, Andrew Gozillon, Michael Klemm, Jan Leyonberg, Dan Palermo

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsAdvanced Micro Devices (Canada)
Fundersnot available
KeywordsCompilerFortranGraphicsSupercomputerPipeline (software)Code (set theory)Source codeMultithreading

Abstract

fetched live from OpenAlex

Modern-day supercomputers are massively parallel, heterogeneous systems, many of which employ graphics processing units (GPUs) to accelerate applications. While C/C++, and also Python, gain traction in the high-performance computing (HPC) domain, Fortran continues to have a large developer base with new high-performance code written every day. The OpenMP application programming interface (API) is a key ingredient to provide multithreading and support for offloading execution to GPUs for HPC applications. To meet this need, AMD is developing the AMD Next Generation Fortran compiler (“AMD Flang”) to replace the existing “Classic Flang” compiler in the ROCm™ 7.0 release. This paper describes the general compilation pipeline of the AMD Next Generation Fortran Compiler. It shows how the compiler generates code for OpenMP target directives and their map clauses. The paper closes with a discussion of transformations in intermediate representation, such as implementing DO CONCURRENT using OpenMP intermediate code.

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 imitation

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

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.939
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0020.001
Open science0.0020.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.067
GPT teacher head0.330
Teacher spread0.263 · 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 teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations1
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207