Register

Recent questions tagged page-faults

0 0 votes
0 0 answers
465
465 views
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 ha...
User Avatar
1 1 vote
2 2 answers
2.5k
2.5k views
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$ instr...
User Avatar
3 3 votes
1 1 answer
1.8k
1.8k views
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 ...
User Avatar
0 0 votes
1 answers 1 answer
1.1k
1.1k views
Made Easy Test Series:Operating System-Page Fault
Consider a system using demand paging architectureit takes $3ms.$ to service page fault if either empty frame is available or replaced page is not to be modifiedtakes $10...
User Avatar
2 2 votes
0 0 answers
412
412 views
Vani Question Bank:Operating System
User Avatar
0 0 votes
1 1 answer
7.1k
7.1k views
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 ...
User Avatar
1 1 vote
0 0 answers
1.1k
1.1k views
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 p...
User Avatar
0 0 votes
1 1 answer
613
613 views
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...
User Avatar
0 0 votes
1 1 answer
763
763 views
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 i...
User Avatar
0 0 votes
0 0 answers
732
732 views
Made Easy
Shouldnt we take 1 instead of 1-P ?? As it should be sequential access???
User Avatar
0 0 votes
0 0 answers
430
430 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
0 0 votes
1 1 answer
2.0k
2.0k views
Effective memory access time
Suppose: TLB lookup time = 20 nsTLB hit ratio = 80%Memory access time = 75 nsSwap page time = 500,000 ns50% of pages are dirtyOS uses a single level page tableWhat is the...
User Avatar
0 0 votes
1 1 answer
2.9k
2.9k views
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 alrea...
User Avatar
7 7 votes
1 answers 1 answer
2.1k
2.1k views
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 ...
User Avatar
2 2 votes
0 0 answers
936
936 views
Self doubt on EMAT
For page fault Some where I seeEMAT=page fault (page fault service time) +(1-page fault)(memory access time)BUT somewhere it's likeEMAT=page fault (page fault service tim...
User Avatar
0 0 votes
0 0 answers
1.2k
1.2k views
Self Doubt [Effective memory access time]
Page fault rate = pMain memory access time = mPage fault service time = PSEMAT = (1-p) (m) + (p) (PS + m)OREMAT = (1-p) (m) + (p) (PS)which one is right ...if page fault...
User Avatar
2 2 votes
1 1 answer
966
966 views
MadeEasy Subject Test 2019: Operating System - Virtual Memory
User Avatar
0 0 votes
0 0 answers
1.2k
1.2k views
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 confuse...
User Avatar
0 0 votes
0 0 answers
668
668 views
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 th...
User Avatar
0 0 votes
1 1 answer
3.4k
3.4k views
Galvin #page fault service time #memory management #disk access
User Avatar
2 2 votes
4 4 answers
2.2k
2.2k views
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]...
User Avatar
0 0 votes
1 1 answer
584
584 views
Page Fault Doubt
https://gateoverflow.in/2122/gate2011-20-ugcnet-june2013-ii-48in the solution why memory access is not considered along with page fault service time when a page fault occ...
User Avatar
2 2 votes
1 1 answer
4.3k
4.3k views
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 modif...
User Avatar
0 0 votes
1 1 answer
2.6k
2.6k views
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 faulti-p is the probability that page is present in Main MemoryPS is t...
User Avatar
0 0 votes
1 1 answer
4.1k
4.1k views
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 n...
User Avatar
2 2 votes
2 answers 2 answers
1.7k
1.7k views
ISRO CSE 2018 | Question: 20
Determine the number of page faults when references to pages occur in the order - $1, 2, 4, 5, 2, 1, 2, 4$. Assume that the main memory can accommodate $3$ pages and the ...
User Avatar
2 2 votes
1 1 answer
4.3k
4.3k 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
498
498 views
Gate_2018_model_Paper
There is any difference or same these two statement?1. Page fault service time is 10ms.2. The Time to service a page fault is on average 10ms.
User Avatar
1 1 vote
1 1 answer
759
759 views
page replacemment policy
A system uses optimal policy for a page replacement. It has 4 page frames with no pages loaded to begin with. Consider the following scenarioCase-1: System first accesses...
User Avatar
3 3 votes
3 answers 3 answers
2.5k
2.5k views
VirtualGate2018-I-64
Suppose a $32 K×8 K$ matrix A with $1$-byte elements is stored in row major order in virtual memory. Assume that only the program in question occupies space in physical m...
User Avatar
Page: