MétaCan
Menu
Back to cohort

Profiling and Understanding CPU Power Management in Linux

2023· article· en· W4392412513 on OpenAlexaff
Ti Zhou, Haoyu Wang, Xinyi Li, Man Lin

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsSt. Francis Xavier University
Fundersnot available
KeywordsProfiling (computer programming)Operating systemComputer sciencePower managementEmbedded systemPower (physics)Physics

Abstract

fetched live from OpenAlex

Dynamic Voltage and Frequency Scaling (DVFS) is a popular technique for power management. Understanding the DVFS principles and the current practice of existing DVFS governors embedded in operating systems (OS) is essential. This work aims to provide a deep understanding of DVFS power management through real-time profiling on various Linux platforms, including an Intel-based laptop, an ARM-based Jetson Nano Board, and a Raspberry Pi platform. We first present the theoretical model for dynamic and static power consumption and describe experiments on three platforms to show how frequency affects their power consumption. We then visualize the real-time behaviour of the existing DVFS governors: the Ondemand and Conservative governors in OS kernels on multiple platforms under different parameter settings. Furthermore, we identify issues that may be encountered in actual hardware experiments but are often overlooked by researchers. Examples are coarse-grained frequency levels and the OS interface not reflecting the actual frequency. Finally, we design experiments to explore the relationship between utilization and power. This work can help DVFS algorithm designers to consider the practical aspect of integrating DVFS algorithms into actual systems.

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.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.049
GPT teacher head0.288
Teacher spread0.239 · 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 designObservational
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

Citations2
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207