Register

Recent questions tagged translation-lookaside-buffer

0 0 votes
0 0 answers
740
740 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 53 (Page No. 261)
Write a program that demonstrates the effect of $TLB$ misses on the effective memory access time by measuring the per-access time it takes to stride through a large array...
User Avatar
0 0 votes
0 0 answers
490
490 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 23 (Page No. 256)
How can the associative memory device needed for a $TLB$ be implemented in hardware, and what are the implications of such a design for expandability?
User Avatar
1 1 vote
1 1 answer
1.8k
1.8k views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 22 (Page No. 256)
A computer whose processes have $1024$ pages in their address spaces keeps its page tables in memory. The overhead required for reading a word from the page table is $5\:...
User Avatar
2 2 votes
2 2 answers
1.3k
1.3k views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 16 (Page No. 255)
You are given the following data about a virtual memory system:The $TLB$ can hold $1024$ entries and can be accessed in $1$ clock cycle $(1\: nsec).$ A page table entry c...
User Avatar
1 1 vote
1 1 answer
1.3k
1.3k views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 11 (Page No. 255)
Consider the following C program: int X[N]; int step = M; /* M is some predefined constant */ for (int i = 0; i < N; i += step) X[i] = X[i] + 1;If this program is run on ...
User Avatar
0 0 votes
1 1 answer
1.1k
1.1k views
Self Doubt : Regarding TLB entry for a page not present in memory
If a page is not present in the memory, then its corresponding entry in the page table would have the ‘Present’ bit set as 0 to indicate , the page is not present.Will th...
User Avatar
1 1 vote
1 1 answer
11.9k
11.9k views
ISI2017-PCB-CS-5(b)
Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Tra...
User Avatar
0 0 votes
1 1 answer
845
845 views
Galvin Edition 9 Exercise 9 Question 15 (Page No. 452)
A simplified view of thread states is $Ready$, $Running$, and $Blocked$,where a thread is either ready and waiting to be scheduled, is running on the processor, or is blo...
User Avatar
0 0 votes
1 1 answer
3.3k
3.3k views
Galvin Edition 9 Exercise 9 Question 14 (Page No. 452)
Assume that a program has just referenced an address in virtual memory. Describe a scenario in which each of the following can occur. (If no such scenario can occur, expl...
User Avatar
1 1 vote
0 0 answers
1.6k
1.6k views
Caching
Given the following information: • TLB hit rate 95%, TLB access time is 1 cycle. • cache hit rate 90 %, cache access time is 1 cycle. • When TLB and cache both get miss; ...
User Avatar
0 0 votes
0 0 answers
2.0k
2.0k views
effective memory access time
A demand paging uses a TLB and a single level page table stored in main memory. The memory access time is 5s. The page fault service time is 25s. If 70% of access is in T...
User Avatar
0 0 votes
0 0 answers
510
510 views
TLB misses
122048none
User Avatar
2 2 votes
1 1 answer
1.3k
1.3k views
TLB hit ration and memory lookup time
Consider a system where TLB lookup time is $25$ ns and memory access time is $200$ ns, respectively. Assuming a virtual address space of $2$ KB, page size of $32$ bytes, ...
User Avatar
0 0 votes
1 answers 1 answer
960
960 views
me test series
A computer system implements a 38 bit virtual address, page size of 16 KB, and 256 entries translation look aside buffer (TLB) organized into 32 sets each having 8 ways. ...
User Avatar
0 0 votes
0 0 answers
436
436 views
UPPCL AE 2018:57
Consider the following $\text{C}$ function executed in an $\text{OS}$ with paging where the page size is $4$ kilobytes. Further, assume that the system employs a $32-$ en...
User Avatar
1 1 vote
1 answers 1 answer
2.2k
2.2k views
Os TLB question
How they calculated time for number of levels?
User Avatar
0 0 votes
1 1 answer
1.8k
1.8k views
MadeEasy Subject Test 2019: Operating System - Translation Lookaside Buffer
A TLB is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit where a memory reference take...
User Avatar
0 0 votes
1 1 answer
2.2k
2.2k views
TLB OS
Why the formula used here is not P(10) + (1-P)(50) = 20 ?;A computer keeps its page tables in memory. The time required to read a word from the pagetable is 50ns. To redu...
User Avatar
0 0 votes
1 1 answer
1.7k
1.7k views
ace test series
A computer whose processes have 1024 pages in their address spaces keeps its page tables in memory. The overhead required for reading a word from the page table is 500 ns...
User Avatar
0 0 votes
0 0 answers
842
842 views
raman classes test series
..an getting 0.00010650
User Avatar
0 0 votes
0 0 answers
1.3k
1.3k views
SudoGate Test Series - Virtual Memory
A computer system has TLB access time = 30 ns and the main memory access time is 150 ns and if the miss rate is 20 % the calculate the effective memory access time if 3 l...
User Avatar
0 0 votes
2 2 answers
4.1k
4.1k views
Memory overhead in Multilevel paging with TLB
Consider a computer system using 2-level paging with TLB.The logical address supported is 32 bits.The page table is divided into 512 pages each of size 1K.The memory acce...
User Avatar
1 1 vote
1 1 answer
696
696 views
Estimate the average time to access data from memory
Estimate the average time to access data from memory with the following information, page fault service time = $2$ ms, memory access time = $200$ ns, $10$ page faults for...
User Avatar
1 1 vote
2 2 answers
2.8k
2.8k views
Virtual Memory
Which of the following is true?A. If the page size increases page fault rate may also increase.B. Multi-level paging optimizes program execution time.C. Dynamic linking i...
User Avatar
0 0 votes
0 0 answers
567
567 views
caching and virtual memory
I am having troble with these following questions. Please I need help
User Avatar
2 2 votes
0 0 answers
4.1k
4.1k views
Does every process have its own TLB?
I know that every process has its own page table and but is it the same with TLB? Does every process have its own TLB or there is a master TLB which is used by all the pr...
User Avatar
2 2 votes
1 1 answer
4.4k
4.4k views
My doubt on TLB and page fault
First read this whole thing what I am writing below:Case 1: If we have to access unit address in memory using TLB and we assume that no page fault occurs then,EMAT=p( T+M...
User Avatar
0 0 votes
0 0 answers
779
779 views
TLB JUST FOR KNOWLEDGE
TLB IS EITHER HARDWARE OR SOFTWARE PLZ EXPLAIN BRIEFLY?????
User Avatar
0 0 votes
0 0 answers
763
763 views
OS TLB
compute system implement a 36-bit virtual address page size of 16KB and a 256-entry translation look aside buffer organized into 64 sets each having four ways.assume that...
User Avatar
Page: