MétaCan
Menu
Back to cohort
Record W2033947775 · doi:10.1109/wescan.1993.270572

Garbage collection software integrated with the system swapper in a virtual memory system

2002· article· en· W2033947775 on OpenAlexaff
J.D. Katzberg, P. Katzberg

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicHandwritten Text Recognition Techniques
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsGarbageGarbage collectionComputer scienceLispManual memory managementModular designTable (database)Hash tableOperating systemSoftwareVirtual memoryDatabaseMemory managementProgramming languageHash function

Abstract

fetched live from OpenAlex

The authors have designed and implemented a modular Lisp interpreter for garbage collector evaluation. Data structures such as the list store, the hash table, the symbol table and the stacks were kept in separate modules with only the routines needed to handle them. Routines in other modules may only read and manipulate these data structures through the specified routines. Using this approach, when a garbage collector strategy or method of storing list cells is changed only the store module need be modified. Test programs and measurement strategies were designed for evaluating garbage collector performance in a virtual memory environment. Three garbage collectors have been coded and tested. They are a conventional link reversal marking garbage collector, a conventional recopying garbage collector, and a garbage collector integrated with the system swapper. The implementations are described and their performances are compared.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.964
Threshold uncertainty score0.419

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
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.010
GPT teacher head0.191
Teacher spread0.181 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicHandwritten Text Recognition TechniquesFrench-language works237,207