A protection cache architecture for the multi-view memory model and its performance
Bibliographic record
Abstract
This paper presents a supporting architecture for the multi-view memory model and investigates its performance. The multi-view memory model is intended to provide applications with the variable-sized access units that they require for optimal performance within a computer system. The supporting architecture provides for the addressability of the state information which is kept on each variable sized-access unit. It is also designed to provide applications with a choice of access control protocol on various memory regions. Caches are integral to the architectural design. They allow for on-the-fly access rights determination and also for the flexibility of protocol choices. The miss rates on the caches within the access control protection subsystem architecture are determined using synthetic traces as input. The emphasis in this study is not to determine how traditional factors such as cache size, degree of associativity and line size affect the miss rates, but is targeted at evaluating the effect that views and their definitions have on the performance. It is found that the protection cache miss rate vary according to the sites of the access units defined within the views and the number and ratio of the differently-sized access unit entries within the protection cache.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".