MétaCan
Menu
Back to cohort
Record W2550054730 · doi:10.82308/41994

Sablejit : a retargetable just-in-time compiler

2004· dissertation· en· W2550054730 on OpenAlexfundno aff
David Belanger

Bibliographic record

VenueeScholarship@McGill (McGill) · 2004
Typedissertation
Languageen
FieldComputer Science
TopicLogic, programming, and type systems
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCompilerComputer sciencePortingSoftware portabilityProgramming languageOperating systemJust-in-time compilationVirtual machineJavaRuntime systemCode generationEmbedded systemSoftwareKey (lock)

Abstract

fetched live from OpenAlex

In this thesis, we introduce SableJIT, a retargetable just-in-time compiler for the SableVM Java virtual machine. Our design attempts to minimize the amount of work required to port (or to retarget) our compiler to a new platform. We accomplish this in three ways. First, we introduce a retargetable backend where the amount of work required to port it is reduced to the implementation of simple well-defined primitive functions. Second, we keep all code related to the internals of the virtual machine in the frontend, making knowledge of the target architecture sufficient for a port. Finally, we provide a good development environment that favours incremental development and testing, in part through a robust runtime system that can recover from compilation failures. We demonstrate the portability of SableJIT by supporting three processor architectures and various operating systems. In particular, we describe the experience acquired in porting our compiler to the Solaris/SPARC platform.

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.003
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: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.002

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.020
GPT teacher head0.239
Teacher spread0.220 · 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
GenreOther

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
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueeScholarship@McGill (McGill)Same topicLogic, programming, and type systemsFrench-language works237,207