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
Recent questions tagged page-fault
0
votes
0
answers
31
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 52 (Page No. 260 - 261)
Write a program that simulates a toy paging system that uses the $\text{WSClock}$ algorithm. The system is a toy in that we will assume there are no write references (not very realistic), and process ... references. Explain what is needed to extend the program to handle a page reference stream that also includes writes.
admin
asked
in
Operating System
Oct 26, 2019
by
admin
391
views
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
0
votes
0
answers
32
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 51 (Page No. 260)
Write a program that simulates a paging system using the aging algorithm. The number of page frames is a parameter. The sequence of page references should be read from a file. For a given input file, plot the number of page faults per $1000$ memory references as a function of the number of page frames available.
admin
asked
in
Operating System
Oct 26, 2019
by
admin
521
views
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
1
vote
0
answers
33
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 47 (Page No. 259 - 260)
We consider a program which has the two segments shown below consisting of instructions in segment $0,$ and read/write data in segment $1.$ Segment $0$ has read/execute protection, and segment $1$ has just read/write protection. The ... $1,$ page $4,$ offset $28$ Jump to location in segment $1,$ page $3,$ offset $32$
admin
asked
in
Operating System
Oct 26, 2019
by
admin
759
views
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
0
votes
0
answers
34
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 44 (Page No. 259)
A machine-language instruction to load a $32-bit$ word into a register contains the $32-bit$ address of the word to be loaded. What is the maximum number of page faults this instruction can cause?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
312
views
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
1
vote
1
answer
35
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 42 (Page No. 259)
It has been observed that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults ... page faults, how long would it take to run if twice as much memory were available?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
604
views
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
0
votes
0
answers
36
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 39 (Page No. 259)
You have been hired by a cloud computing company that deploys thousands of servers at each of its data centers. They have recently heard that it would be worthwhile to handle a page fault at server A by reading ... local disk drive. How could that be done? Under what conditions would the approach be worthwhile? Be feasible?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
272
views
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
1
vote
2
answers
37
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 13 (Page No. 255)
If an instruction takes $1\: nsec$ and a page fault takes an additional $n\: nsec,$ give a formula for the effective instruction time if page faults occur every $k$ instructions.
admin
asked
in
Operating System
Oct 26, 2019
by
admin
1.6k
views
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
3
votes
1
answer
38
Self Doubt on Page Fault
To calculate EMAT in case of page fault we used: EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time) My doubt is: In case of NO PAGE FAULT, why we considered only one memory access time . Why ... considered (VA -> PA time) + memory access time. Then why not we consider address translation time in questions involving only pagefault?
tp21
asked
in
Operating System
Sep 22, 2019
by
tp21
1.1k
views
operating-system
virtual-memory
page-fault
0
votes
1
answer
39
Made Easy Test Series:Operating System-Page Fault
Consider a system using demand paging architecture it takes $3ms.$ to service page fault if either empty frame is available or replaced page is not to be modified takes $10ms.$ if replaced page is modified. Main Memory access time ... time. The maximum acceptable page fault rate to get effective memory access time not more than $4ms.$ is_________(%)
srestha
asked
in
Operating System
May 15, 2019
by
srestha
708
views
operating-system
made-easy-test-series
page-fault
2
votes
0
answers
40
Vani Question Bank:Operating System
Hirak
asked
in
Operating System
May 9, 2019
by
Hirak
263
views
operating-system
page-replacement
page-fault
paging
0
votes
1
answer
41
Galvin Edition 9 Exercise 9 Question 21 (Page No. 453)
Consider the following page reference string: $7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 , 1.$ Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms ? $•$ $LRU$ $replacement$ $•$ $FIFO$ $replacement$ $•$ $Optimal$ $replacement$
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
4.2k
views
galvin
operating-system
virtual-memory
page-fault
1
vote
0
answers
42
Galvin Edition 9 Exercise 9 Question 20 (Page No. 453)
When a page fault occurs, the process requesting the page must block while waiting for the page to be brought from disk into physical memory. Assume that there exists a process with five user-level threads and that the mapping of user ... page fault-that is, would they also have to wait for the faulting page to be brought into memory? Explain.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
817
views
galvin
operating-system
virtual-memory
page-fault
descriptive
0
votes
1
answer
43
Galvin Edition 9 Exercise 9 Question 19 (Page No. 453)
Assume that we have a demand-paged memory. The page table is held in registers. It takes $8$ milliseconds to service a page fault if an empty frame is available or if the replaced page is not modified and $20$ milliseconds ... time. What is the maximum acceptable page-fault rate for an effective access time of no more than $200$ nanoseconds ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
308
views
galvin
operating-system
virtual-memory
page-fault
0
votes
1
answer
44
Test series
Consider a system with main memory access time is 150ns and page fault service time is 5 microsecond if one-page fault generated for every 10^3 memory access then what is effective memory access time(in ns)?? The answer given is 154.85 and the answer I am getting is 4850.15 please verify someone
saif
asked
in
Operating System
Jan 31, 2019
by
saif
348
views
operating-system
page-fault
effective-memory-access-time
0
votes
0
answers
45
Made Easy
Shouldnt we take 1 instead of 1-P ?? As it should be sequential access???
anjali007
asked
in
Operating System
Jan 23, 2019
by
anjali007
303
views
operating-system
demand-paging
page-fault
0
votes
0
answers
46
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-$ entry direct mapped $\text{TLB}$ int *alloc_and_init() { int counter, value = 0, size = 2048; int ... of the program, what is the number of $\text{TLB}$ misses during the execution of the for loop? $2048$ $2$ $0$ $1$
admin
asked
in
Operating System
Jan 5, 2019
by
admin
247
views
uppcl2018
operating-system
memory-management
page-fault
translation-lookaside-buffer
0
votes
1
answer
47
Effective memory access time
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% Memory access time = 75 ns Swap page time = 500,000 ns 50% of pages are dirty OS uses a single level page table What is the effective access time (EAT) if we assume the page fault rate is 10%? Assume the cost toupdate the TLB, the page table, and the frame table (if needed) is negligible.
Hardik Vagadia
asked
in
Operating System
Jan 3, 2019
by
Hardik Vagadia
1.4k
views
effective-memory-access
operating-system
page-fault
0
votes
1
answer
48
UGC NET CSE | December 2018 | Part 2 | Question: 72
Suppose for a process $P$, reference to pages in order are $1, 2, 4, 5, 2, 1, 2, 4$. Assume that main memory can accomodate $3$ pages and the main memory has already $1$ and $2$ in the order $1$ ... Replacement Algorithm is used then the number of page faults that occur to complete the execution of process $P$ is $4$ $3$ $5$ $6$
Arjun
asked
in
Operating System
Jan 2, 2019
by
Arjun
2.2k
views
ugcnetcse-dec2018-paper2
operating-system
page-replacement
page-fault
5
votes
1
answer
49
GATE Overflow | Mock GATE | Test 1 | Question: 64
Consider the $2$ dimensional array $A$: int A[][]=new int[100][100]; where $A[0][0]$ is at location $800$ in a paged memory system with pages of size $800 bytes$. Each int type needs 4 bytes and A is stored in row-major order. A small process that ... other $2$ are initially empty? for (int i=0;i<100;i++) for (int j=0;j<100; j++) A[j][i]=1;
Ruturaj Mohanty
asked
in
Operating System
Dec 27, 2018
by
Ruturaj Mohanty
1.2k
views
go-mockgate-1
numerical-answers
page-fault
operating-system
co-and-architecture
cache-memory
2
votes
0
answers
50
Self doubt on EMAT
For page fault Some where I see EMAT=page fault (page fault service time) +(1-page fault)(memory access time) BUT somewhere it's like EMAT=page fault (page fault service time + memory access time) +(1-page fault)(memory access time) Which one is correct and why this difference?
Rishav Kumar Singh
asked
in
Operating System
Dec 26, 2018
by
Rishav Kumar Singh
505
views
effective-memory-access
operating-system
page-fault
0
votes
0
answers
51
Self Doubt [Effective memory access time]
Page fault rate = p Main memory access time = m Page fault service time = PS EMAT = (1-p) (m) + (p) (PS + m) OR EMAT = (1-p) (m) + (p) (PS) which one is right ...if page fault occurs should we consider [ Page fault service time + MM ] OR [ Page fault service time only ]
jatin khachane 1
asked
in
Operating System
Dec 15, 2018
by
jatin khachane 1
620
views
effective-memory-access
page-fault
operating-system
2
votes
1
answer
52
MadeEasy Subject Test 2019: Operating System - Virtual Memory
jatin khachane 1
asked
in
Operating System
Dec 13, 2018
by
jatin khachane 1
487
views
made-easy-test-series
operating-system
virtual-memory
paging
page-fault
0
votes
0
answers
53
OS EMAT vs AMAT
In Page Fault and Demand Paging concept what is the difference between Effective Memory access time and average memory access time? The formulae are known but i am confused with the concept.
Shamim Ahmed
asked
in
Operating System
Dec 9, 2018
by
Shamim Ahmed
874
views
operating-system
effective-memory-access
page-fault
0
votes
0
answers
54
Page Size v/s Page fault
I studied from book william stalling ,it was written there if we increase the size of page then pagefault first increases and then when pagesize become size of process then pagefault decreases. Can someone explain with an example why this happens?
garvit_vijai
asked
in
Operating System
Dec 8, 2018
by
garvit_vijai
413
views
operating-system
page-fault
0
votes
1
answer
55
Galvin #page fault service time #memory management #disk access
gourav94240
asked
in
Operating System
Oct 19, 2018
by
gourav94240
1.5k
views
page-fault
operating-system
effective-memory-access
page-replacement
page
2
votes
4
answers
56
ISI2016-PCB-CS-3
Consider the following extract from a program, written in a C-like language, that computes the transpose of a matrix. for (i=0; i<N; i++) for (j=0; j<N; j++) B[i,j]=A[i,j]; $A$ and $B$ are $N \times N$ matrices with floating point entries ... Each of $A$ and $B$ is stored starting from the beginning of a page None of the pages allocated to $A$ and $B$ are initially in memory.
go_editor
asked
in
Operating System
Sep 18, 2018
by
go_editor
933
views
isi2016-pcb-cs
operating-system
demand-paging
page-fault
non-gate
descriptive
0
votes
1
answer
57
Page Fault Doubt
https://gateoverflow.in/2122/gate2011-20-ugcnet-june2013-ii-48 in the solution why memory access is not considered along with page fault service time when a page fault occurs? Because after page fault the page has to be brought into the memory which needs memory access
aditi19
asked
in
Operating System
Sep 13, 2018
by
aditi19
347
views
page-fault
effective-memory-access
2
votes
1
answer
58
MadeEasy Test Series: Operating System - Page Replacement
Consider a demand paged memory system, page table is held in registers. It takes 800 nsec to service a page fault if empty page is available or replaced page is not modified and 950 nsec if the replaced page is modified, ... modified 85% of time and page faultrate is 20% then average memory access time is ________. (Upto 1 decimal place)
jhaanuj2108
asked
in
Operating System
Aug 14, 2018
by
jhaanuj2108
2.5k
views
made-easy-test-series
operating-system
demand-paging
page-fault
page-replacement
0
votes
1
answer
59
EMAT in case of page fault
I have read that EMAT when the page fault occurs is =p(PS+MA)+(1-p)(MA) p is the probability of page fault i-p is the probability that page is present in Main Memory PS is the Page fault service time MA is the memory access time but according to me first it ... which is going to take one Memory access So,EMAT should be equals=p(MA+PS+MA)+(1-p)(MA+MA). why it is not so??
CHIRAG CHAWLA
asked
in
Operating System
Aug 11, 2018
by
CHIRAG CHAWLA
1.5k
views
page-fault
operating-system
effective-memory-access
0
votes
1
answer
60
UGC NET CSE | July 2018 | Part 2 | Question: 58
Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement algorithm is implemented with 3 page frames in main memory. Then the number of page faults are _____ 5 7 9 10
Pooja Khatri
asked
in
Operating System
Jul 13, 2018
by
Pooja Khatri
3.4k
views
ugcnetcse-july2018-paper2
operating-system
page-fault
paging
Page:
« prev
1
2
3
4
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 page-fault
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:...