edited by
34,186 views
73 73 votes
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}$ organized into $32$ sets each having $4$ ways. Assume that the $\text{TLB}$ tag does not store any process id. The minimum length of the $\text{TLB}$ tag in bits is ______.

9 Answers

Answer:
Position:
Show:

Related questions

102 102 votes
7 answers 7 answers
32.4k
32.4k views
go_editor asked Feb 13, 2015
32,424 views
A computer system implements $8\;\text{kilobyte}$ pages and a $32\text{-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, three permi...
43 43 votes
5 answers 5 answers
12.3k
12.3k views
go_editor asked Feb 12, 2015
12,272 views
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$ and $250$ $\text{KB}$, where $\text{...
77 77 votes
11 answers 11 answers
54.7k
54.7k views
go_editor asked Feb 12, 2015
54,727 views
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ resources. Which one of the following values of $N$ could ...
53 53 votes
4 answers 4 answers
17.9k
17.9k views
go_editor asked Feb 12, 2015
17,875 views
Consider the C program below#include <stdio.h int *A, stkTop; int stkFunc (int opcode, int val) { static int size=0, stkTop=0; switch (opcode) { case -1: size = val; brea...