Deutsch English Français Italiano |
<vh33n0$2crf1$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder2.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Thomas Koenig <tkoenig@netcologne.de> Newsgroups: comp.arch Subject: Re: Reverse engineering of Intel branch predictors Date: Wed, 13 Nov 2024 20:54:56 -0000 (UTC) Organization: A noiseless patient Spider Lines: 14 Message-ID: <vh33n0$2crf1$1@dont-email.me> References: <vfbfn0$256vo$1@dont-email.me> <c517f562a19a0db2f3d945a1c56ee2e6@www.novabbs.org> <jwv1q002k2s.fsf-monnier+comp.arch@gnu.org> <a3d81b5c64ce058ad21f42a8081162cd@www.novabbs.org> <jwvcyj1sefl.fsf-monnier+comp.arch@gnu.org> <abef7481ff0dd5d832cef0b9d3ea087a@www.novabbs.org> <jwv1pzhsahr.fsf-monnier+comp.arch@gnu.org> <8928500a87002966d6282465c037003e@www.novabbs.org> <jwvpln0qpel.fsf-monnier+comp.arch@gnu.org> <18bfd4ce1048f68ad4d39d972c459e99@www.novabbs.org> <jwv7c98qell.fsf-monnier+comp.arch@gnu.org> <vh1i5u$235kt$1@dont-email.me> <jwvfrnvp23p.fsf-monnier+comp.arch@gnu.org> Injection-Date: Wed, 13 Nov 2024 21:54:56 +0100 (CET) Injection-Info: dont-email.me; posting-host="c7aa2ad109086fd4f536673ce5d02993"; logging-data="2518497"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19Ptf/23zjaK1pi8PrcqdixGBc+edWQVWM=" User-Agent: slrn/1.0.3 (Linux) Cancel-Lock: sha1:o4rTMxagT2V6iHi4j3C46X+89/o= Bytes: 2212 Stefan Monnier <monnier@iro.umontreal.ca> schrieb: > If you consider the two levels of language at play (the CPU view > at the level of machine language and the interpreter's view of the > bytecode language), IIUC the branch history of the CPU view ends up > being a usable approximation of the bytecode-level instruction pointer, > so for those sections of your bytecode-level program which are sufficiently > repetitive, the prediction applied by the CPU can correctly predict the > next bytecode. To me, that looks like the bytecode is insufficiently expressive, if an often-repeating sequence occurs :-) In the presence of a good predictor, it would still be an interesting question if a more compressed version would actually perform better.