MétaCan
Menu
Back to cohort
Record W2147174702 · doi:10.1109/pccc.1989.37398

Improving file system performance by dynamically restructuring disk space

2003· article· en· W2147174702 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Storage Technologies
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsUnixComputer scienceOperating systemUnix file typesFile systemRestructuringDatabaseFragmentation (computing)Computer fileStub file

Abstract

fetched live from OpenAlex

As files are added to and deleted from a file system, the disk becomes fragmented, much as main memory becomes fragmented, because of dynamic storage management. After a period of time, individual files tend to be spread across the disk rather than stored in contiguous areas. When this happens, file access times increase and disk throughput decreases. One possible solution to this problem involves disk restructuring techniques: the constituent disk blocks of selected files are moved so that total seek time for these files is decreased. Techniques to determine which files should be restructured based on the principle of least effort are introduced, and the results of experiments on a 4.2 BSD Unix file system are presented. The experiments demonstrated that over a two-week period seek time performance degraded by more than 20% as a result of fragmentation, despite attempts to control it through careful allocation.< <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.

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: Methods · Consensus signal: none
Teacher disagreement score0.825
Threshold uncertainty score0.543

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.004
GPT teacher head0.185
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

Quick stats

Citations11
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Storage TechnologiesFrench-language works237,207