Liste des Groupes | Revenir à c arch |
mitchalsup@aol.com (MitchAlsup1) writes:Anton Ertl wrote:
>mitchalsup@aol.com (MitchAlsup1) writes:>I recall that MIPS could emulate a TLB table walk in something like
19 cycles. That is:: a few cycles to get there, a hash table access,
a check, a TLB install, and a few cycles to get back.Which MIPS? R2000? R10000? Something else? Was this an inverted page>
table?
R3000 and it was a hast table ~1MB in size.
Would would have been a significant fraction (25%?)of theI heard numbers in the 10% range, so we are within a factor of 2 in
total memory available on a R3k based system in 1990.
Les messages affichés proviennent d'usenet.