Predicting Indirect Branches via Data Compression¶
Kalamatianos, J., & Kaeli, D. R. (1998/2026). Predicting Indirect Branches via Data Compression. MICRO 1998, 3-4.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Prediction by Partial Matching
- Kalamatianos and Kaeli named an indirect-branch target predictor after PPM, but their approximate tables and highest-valid-history target selection are an adaptation; the paper does not establish that this predictor calculates the same full novelty-escape distribution as classic compression PPM.
This sourceUsed only for the named-adaptation boundary, not to assert equivalence with classic PPM probability coding.
- Kalamatianos and Kaeli named an indirect-branch target predictor after PPM, but their approximate tables and highest-valid-history target selection are an adaptation; the paper does not establish that this predictor calculates the same full novelty-escape distribution as classic compression PPM.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:1392d64fdf08 · see in the full table