Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Notes
Short Notes
Recent questions tagged virtual-memory
0
votes
0
answers
91
Galvin Edition 9 Exercise 9 Question 11 (Page No. 451)
Segmentation is similar to paging but uses variable-sized pages. Define two segment-replacement algorithms, one based on the FIFO page replacement scheme and the other on the LRU page-replacement scheme. Remember that ... segment. Consider strategies for systems where segments cannot be relocated and strategies for systems where they can.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
368
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
92
Galvin Edition 9 Exercise 9 Question 10 (Page No. 451)
You have devised a new page-replacement algorithm that you think may be optimal. In some contorted test cases, Belady’s anomaly occurs. Is the new algorithm optimal ? Explain your answer.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
318
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
93
Galvin Edition 9 Exercise 9 Question 9 (Page No. 451)
Suppose that you want to use a paging algorithm that requires a reference bit (such as second-chance replacement or working-set model), but the hardware does not provide one. Sketch how you could simulate a reference bit even if one were not ... , or explain why it is not possible to do so. If it is possible, calculate what the cost would be.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
260
views
galvin
operating-system
virtual-memory
0
votes
0
answers
94
Galvin Edition 9 Exercise 9 Question 8 (Page No. 451)
Consider the following page reference string: $1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.$ How many page faults would occur for the following replacement algorithms, assuming one, ... frames are initially empty, so your first unique pages will cost one fault each. $LRU$ replacement $FIFO$ replacement $Optimal$ replacement
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
529
views
galvin
operating-system
virtual-memory
0
votes
0
answers
95
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 of size $200$. A small process that manipulates the matrix resides in page $0$ (locations $0$ to $ ... $for (int j = 0; j < 100; j++)$ $A[i][j] = 0;$
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
196
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
96
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 other than the current one. Pages have $1,000$ words, ... this system, assuming that the system is running one process only and that the processor is idle during drum transfers.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
190
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
97
Galvin Edition 9 Exercise 9 Question 5 (Page No. 450)
Discuss the hardware support required to support demand paging.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
172
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
98
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 algorithms that suffer from Belady’s anomaly from those that do not. $a$. $LRU$ replacement $b$. $FIFO$ replacement $c$. Optimal replacement $d$. Second-chance replacement
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
282
views
galvin
operating-system
virtual-memory
descriptive
1
vote
0
answers
99
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 occur in it. Answer these questions for any page-replacement algorithms: $a$. What ... of $page$ $faults$ ? $b$. What is an $upper$ $bound$ on the number of $page$ $faults$ ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
202
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
100
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.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
196
views
galvin
operating-system
virtual-memory
descriptive
1
vote
0
answers
101
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; page fault rate is 1% The TLB access and acache access are ... cycles Access to hard drive requires 50,000 cycles. Compute the average memory access latencies when the cache is physically addresses (in cycles).
s_dr_13
asked
in
CO and Architecture
Mar 10, 2019
by
s_dr_13
1.1k
views
cache-memory
co-and-architecture
virtual-memory
translation-lookaside-buffer
0
votes
1
answer
102
Virtual Memory
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by Instruction Set Architecture page size physical memory size number of processes in memory Why the answer for the above question is “ISA” ?? Please explain the concept behind it
s_dr_13
asked
in
Operating System
Mar 8, 2019
by
s_dr_13
457
views
virtual-memory
memory-management
63
votes
4
answers
103
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 is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path ... TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$
Arjun
asked
in
Operating System
Feb 7, 2019
by
Arjun
21.4k
views
gatecse-2019
operating-system
virtual-memory
2-marks
0
votes
0
answers
104
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 TLB and of the remaining, 20% is not present in the main memory. The effective memory access time is? Thanks!
Abhipsa
asked
in
Operating System
Jan 27, 2019
by
Abhipsa
1.2k
views
operating-system
translation-lookaside-buffer
hit-ratio
paging
virtual-memory
1
vote
3
answers
105
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 bit and 1 reference bit. Then the approximate page table size in ... nearest bytes, or sometimes we consider it as bits also. If yes, then in what case we take it as bits.
CSHuB
asked
in
Operating System
Jan 24, 2019
by
CSHuB
643
views
operating-system
virtual-memory
made-easy-test-series
0
votes
0
answers
106
Made Easy CBT
Consider the system which has virtual address of 36 bits and physical address of 30 bits and page size of 8 KB, page table entry contain 1 valid bit, 2 protection bit and 1 reference bit. Then the approximate page table size in (MB) is ________.
pream sagar
asked
in
Operating System
Jan 23, 2019
by
pream sagar
671
views
operating-system
paging
virtual-memory
1
vote
3
answers
107
Self doubt
Virtual memory increases context switching overhead ? Why why not ?
kman30
asked
in
Operating System
Jan 19, 2019
by
kman30
686
views
operating-system
virtual-memory
context
context-switch
2
votes
2
answers
108
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 a single physical frame. iii. The system must be able to support virtual address ... no more than two levels of page tables. What is the minimum page size that your system must have? 8KB 16KB 32KB none
bhanu kumar 1
asked
in
Operating System
Jan 18, 2019
by
bhanu kumar 1
878
views
multilevel-paging
virtual-memory
0
votes
0
answers
109
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 apply T = h*x + (1-h)*y Here assuming single level pagetable I suppose x is the time for accessing the page table and getting ... frame I 0) why he considered here an extra access ? Reference : https://gateoverflow.in/85404/gate1990-7-b Help me out here :(
Na462
asked
in
Operating System
Jan 17, 2019
by
Na462
259
views
operating-system
virtual-memory
paging
effective-memory-access
self-doubt
2
votes
0
answers
110
Ace Test Series: Operating System - Virtual Memory
amitqy
asked
in
Operating System
Jan 12, 2019
by
amitqy
803
views
operating-system
virtual-memory
paging
memory-management
ace-test-series
1
vote
1
answer
111
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 seconds.
snaily16
asked
in
Operating System
Jan 10, 2019
by
snaily16
482
views
gateforum-test-series
operating-system
virtual-memory
0
votes
0
answers
112
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 dirty is 0.5. If a memory access takes 100 ms. The effective access time is ___ ms?
snaily16
asked
in
Operating System
Jan 10, 2019
by
snaily16
1.1k
views
operating-system
virtual-memory
gateforum-test-series
2
votes
1
answer
113
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) ?
3lurryface
asked
in
Operating System
Jan 9, 2019
by
3lurryface
1.1k
views
operating-system
virtual-memory
memory-management
paging
0
votes
1
answer
114
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.
aambazinga
asked
in
Databases
Jan 8, 2019
by
aambazinga
617
views
file-indexing
virtual-memory
0
votes
1
answer
115
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 frame increases the page fault rate.
sripo
asked
in
Operating System
Dec 28, 2018
by
sripo
900
views
page-replacement
virtual-memory
operating-system
4
votes
1
answer
116
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 fault TLB hit and page replacement TLB miss and page fault TLB hit with no page fault
Ruturaj Mohanty
asked
in
Operating System
Dec 27, 2018
by
Ruturaj Mohanty
1.3k
views
go-mockgate-1
operating-system
memory-management
virtual-memory
2
votes
2
answers
117
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 in all cases. In such situation which of the following ... cannot be used in such situation Virtual memory concept can be used to give multiprogramming capability to system
Ruturaj Mohanty
asked
in
Operating System
Dec 27, 2018
by
Ruturaj Mohanty
1.4k
views
go-mockgate-1
operating-system
memory-management
virtual-memory
8
votes
1
answer
118
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 physical frames is $4\text{KB}$. The system has $8\text{GB}$ physical RAM. The system allows a maximum of ... $4 \text{GB} + 4 \text{KB}$ $4 \text{MB} + 4 \text{GB}$
Ruturaj Mohanty
asked
in
Operating System
Dec 27, 2018
by
Ruturaj Mohanty
2.4k
views
go-mockgate-1
virtual-memory
memory-management
operating-system
2
votes
1
answer
119
MadeEasy Subject Test 2019: Operating System - Virtual Memory
jatin khachane 1
asked
in
Operating System
Dec 13, 2018
by
jatin khachane 1
480
views
made-easy-test-series
operating-system
virtual-memory
paging
page-fault
0
votes
2
answers
120
NIELIT 2018-48
Decreasing the RAM causes fewer page faults more page faults virtual memory gets increased virtual memory gets decreased
Arjun
asked
in
Operating System
Dec 7, 2018
by
Arjun
3.4k
views
nielit-2018
operating-system
virtual-memory
Page:
« prev
1
2
3
4
5
6
7
8
9
10
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged virtual-memory
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...