Branch prediction based on universal data compression algorithms

Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this work we consider two universal compression algorithms: prediction by partial matching (PPM), and a recently developed metho...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings. 25th Annual International Symposium on Computer Architecture (Cat. No.98CB36235) s. 62 - 72
Hlavní autori: Federovsky, E., Feder, M., Weiss, S.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1998
Predmet:
Adaptive algorithm
Application software
Compression algorithms
Computer architecture
Data compression
Entropy
Information theory
Memory management
Prediction methods
Random sequences
ISBN:9780818684913, 0818684917
ISSN:1063-6897
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this work we consider two universal compression algorithms: prediction by partial matching (PPM), and a recently developed method, context tree weighting (CTW). We describe the prediction algorithms induced by these methods. We also suggest adaptive algorithms variations of the basic methods that attempt to fit limited memory constraints and to match the non-stationary nature of the branch sequence. Furthermore, we show how to incorporate address information and to combine other relevant data. Finally, we present simulation results for selected programs from the SPECint95, SYSmark/32, SYSmark/NT, and transactional processing benchmarks. Our results are most promising in programs with difficult to predict branch behavior.
ISBN:9780818684913
0818684917
ISSN:1063-6897
DOI:10.1109/ISCA.1998.694763