search
Log In
0 votes
49 views
A computer with an $8-KB$ page, a $256-KB$ main memory, and a $64-GB$ virtual address space uses an inverted page table to implement its virtual memory. How big should the hash table be to ensure a mean hash chain length of less than $1?$ Assume that the hash table size is a power of two.
in Operating System 49 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
90 views
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. Explain the main concepts behind the program, and describe what you expect the output to ... . Repeat part $(b)$ but for an older computer with a different architecture and explain any major differences in the output.
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 90 views
0 votes
0 answers
2
102 views
Virtual memory provides a mechanism for isolating one process from another. What memory management difficulties would be involved in allowing two operating systems to run concurrently? How might these difficulties be addressed?
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 102 views
0 votes
1 answer
3
0 votes
0 answers
4
62 views
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 can be found in $100$ clock cycles or $100\: nsec.$ The average page replacement time is $6\: msec.$ ... by the $TLB\:\: 99\%$ of the time, and only $0.01\%$ lead to a page fault, what is the effective address-translation time?
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 62 views
...