Register

Recent questions tagged virtual-memory

0 0 votes
0 0 answers
316
316 views
Galvin Edition 9 Exercise 9 Question 7 (Page No. 450-451)
Consider the two-dimensional array $A$: $int A[][] $$=$ $new$ $int[100][100];$where $A[0][0]$ is at location $200$ in a paged memory system with pages ...
User Avatar
0 0 votes
0 0 answers
352
352 views
Galvin Edition 9 Exercise 9 Question 6 (Page No. 450)
An operating system supports a paged virtual memory. The central processor has a cycle time of $1$ microsecond. It costs an additional 1 microsecond to access a page othe...
User Avatar
0 0 votes
0 0 answers
312
312 views
Galvin Edition 9 Exercise 9 Question 5 (Page No. 450)
Discuss the hardware support required to support demand paging.
User Avatar
0 0 votes
0 0 answers
427
427 views
Galvin Edition 9 Exercise 9 Question 4 (Page No. 450)
Consider the following page-replacement algorithms. Rank these algorithms on a five-point scale from “bad” to “perfect” according to their page-fault rate. Separate those...
User Avatar
1 1 vote
0 0 answers
391
391 views
Galvin Edition 9 Exercise 9 Question 2 (Page No. 449)
Assume that you have a page-reference string for a process with $m$ frames (initially all empty). The page-reference string has length $p$, and $n$ distinct page numbers ...
User Avatar
0 0 votes
0 0 answers
318
318 views
Galvin Edition 9 Exercise 9 Question 1 (Page No. 449)
Under what circumstances do page faults occur? Describe the actions taken by the operating system when a page fault occurs.
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
1 answers 1 answer
779
779 views
Virtual Memory
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined byInstruction Set Architecturepage sizephysica...
User Avatar
115 115 votes
12 answers 12 answers
39.8k
39.8k views
GATE CSE 2019 | Question: 33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size i...
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
1 1 vote
3 3 answers
1.1k
1.1k views
MadeEasy Test Series 2019: Operating System - Virtual Memory
Consider the system which has the virtual address of 36 bits and physical address of 30 bits and page size of 8 kb, page table entry contains 1 valid bit, 2 protection bi...
User Avatar
0 0 votes
0 0 answers
1.4k
1.4k views
Made Easy CBT
Consider the system which has virtual address of 36 bits and physical address of 30 bits and page size of 8KB, page table entry contain 1 valid bit, 2 protection bit and ...
User Avatar
1 1 vote
3 3 answers
1.2k
1.2k views
Self doubt
Virtual memory increases context switching overhead ? Why why not ?
User Avatar
3 3 votes
2 answers 2 answers
2.1k
2.1k views
gate applied mock test -3
Suppose that you wish to design a virtual memory system with the following characteristics:i. The size of a page table entry is 4 bytes.ii. Each page table must fit into ...
User Avatar
0 0 votes
0 0 answers
555
555 views
Virtual Memory (Self Doubt)
I have a simple doubt, Given a question that says that memory access time is x and page fault service time is y. We applyT = h*x + (1-h)*yHere assuming single level paget...
User Avatar
1 1 vote
1 1 answer
958
958 views
Gateforum Test Series: Operating System - Virtual Memory
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano sec...
User Avatar
0 0 votes
0 0 answers
2.0k
2.0k views
Gateforum Test Series: Operating System - Virtual Memory
Let the page fault probability be 0.6 and page fault service time is 150 ms and time to replace dirty page is 200 ms. In case of a page fault the probability of being dir...
User Avatar
2 2 votes
1 1 answer
2.1k
2.1k views
Paging and virtual memory
If there is 2 or more level paging for processes, is it possible to have more than 1 page fault while accessing any single addressable unit(byte or word) ?
User Avatar
0 0 votes
1 1 answer
1.3k
1.3k views
made easy mock1
TRUE/FALSE:statement 1: secondary index may or may not be dense.statement 2: disk is considered as the maximum size of virtual memory.
User Avatar
0 0 votes
1 1 answer
1.2k
1.2k views
What is the reason for Belady's Anamoly
What is the reason for Belady’s Anomaly,I am aware that it is not a stack based algorithm and for a certain set of pages it shows this anomaly where the increase in page ...
User Avatar
4 4 votes
1 answers 1 answer
2.6k
2.6k views
GATE Overflow | Mock GATE | Test 1 | Question: 18
Assume a program has just referenced an address in virtual memory. Which of the following scenario cannot occur?TLB miss with no page faultTLB hit and page replacementTLB...
User Avatar
2 2 votes
2 answers 2 answers
2.5k
2.5k views
GATE Overflow | Mock GATE | Test 1 | Question: 19
A computer system consists of infinitely large primary memory storage capacity. In other words the physical address space exceeds the logical address space significantly ...
User Avatar
9 9 votes
1 1 answer
3.8k
3.8k views
GATE Overflow | Mock GATE | Test 1 | Question: 38
Consider a system with paging-based memory management, whose architecture allows for a $4\text{GB}$ virtual address space for processes. The size of logical pages and phy...
User Avatar
2 2 votes
1 1 answer
991
991 views
MadeEasy Subject Test 2019: Operating System - Virtual Memory
User Avatar
0 0 votes
2 2 answers
4.0k
4.0k views
NIELIT 2018-48
Decreasing the RAM causesfewer page faultsmore page faultsvirtual memory gets increasedvirtual memory gets decreased
User Avatar
0 0 votes
1 1 answer
2.1k
2.1k 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
3 3 answers
2.4k
2.4k views
OS-Virtual Memory
A computer system has a page size of 1024 bytes and maintains page table for each process in the main memory.The overhead required for doing a lookup in the page table is...
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
0 0 answers
996
996 views
awes previous year
If the number of bits in a virtual address of a program is 12 and the page size is 0.5k bytes, then numbers of pages in the virtual address space is....given ans 128
User Avatar
Page: