MétaCan
Menu
Back to cohort
Record W2928103424 · doi:10.1002/cpe.5231

LTTng‐HSA: Bringing LTTng tracing to HSA‐based GPU runtimes

2019· article· en· W2928103424 on OpenAlexafffund
Paul Margheritta, Michel Dagenais

Bibliographic record

VenueConcurrency and Computation Practice and Experience · 2019
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsPolytechnique Montréal
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceTracingTRACE (psycholinguistics)Profiling (computer programming)Kernel (algebra)SoftwareOperating systemParallel computing

Abstract

fetched live from OpenAlex

Summary In this paper, we propose LTTng‐HSA, a set of tools that allow for the collection of a single, unified software graphics processing unit (GPU) trace in ROCr, a Heterogeneous System Architecture (HSA)‐based API and runtime. HSA is a cross‐vendor standard facilitating the programming of heterogeneous systems that include CPUs, GPUs, and possibly other types of devices. Our open‐source solution is generic and easily adaptable to diverse GPU runtimes or APIs. Using Linux Trace Toolkit Next Generation (LTTng), a highly efficient Linux tracer, it collects different types of events over multiple executions of an application and aims to gather all the data into a single trace, offering an easy way to generate GPU‐related traces. Our instrumentation is achieved simply by preloading libraries, without recompiling the target application, which makes it flexible and easy to use. The resulting traces, which include API call stack information, GPU hardware metrics, command queue, and compute kernel profiling, are well adapted for postprocessing and further analysis. Our solution also includes tracing data from the Linux kernel and proposes views for Trace Compass, an interactive trace visualizer.

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.002
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.030

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0030.003
Open science0.0030.004
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0090.003

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.017
GPT teacher head0.303
Teacher spread0.287 · 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 designBench or experimental
Domainnot available
GenreEmpirical

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

Citations4
Published2019
Admission routes2
Has abstractyes

Explore more

Same venueConcurrency and Computation Practice and ExperienceSame topicDistributed and Parallel Computing SystemsFrench-language works237,207