Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Translation lookaside buffer
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Typical TLB== These are typical performance levels of a TLB:<ref name="typical">{{Cite book|title=Computer Organization And Design. Hardware/Software interface. 4th edition |author=David A. Patterson |author2=John L. Hennessy |year=2009 |publisher=Morgan Kaufmann Publishers |location=Burlington, MA 01803, USA |isbn=978-0-12-374493-7 |page=503 }}</ref> * Size: 12 bits β 4,096 entries <!-- this is wider, than in book --> * Hit time: 0.5 β 1 clock cycle * Miss penalty: 10 β 100 clock cycles<!-- upd to COaD H/S I 4th --> * Miss rate: 0.01 β 1% (20β40% for sparse/graph applications) The average effective memory cycle rate is defined as <math>m + (1-p)h + pm</math> cycles, where <math>m</math> is the number of cycles required for a memory read, <math>p</math> is the miss rate, and <math>h</math> is the hit time in cycles. If a TLB hit takes 1 clock cycle, a miss takes 30 clock cycles, a memory read takes 30 clock cycles, and the miss rate is 1%, the effective memory cycle rate is an average of <math>30 + 0.99 \times 1 + 0.01 \times 30</math> (31.29 clock cycles per memory access).<ref>{{Cite web|date=2019-02-26|title=Translation Lookaside Buffer (TLB) in Paging|url=https://www.geeksforgeeks.org/translation-lookaside-buffer-tlb-in-paging/|access-date=2021-02-10|website=GeeksforGeeks|language=en-US}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)