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
1
vote
0
answers
61
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 7 (Page No. 254)
Using the page table of Fig. $3-9,$ give the physical address corresponding to each of the following virtual addresses: $20$ $4100$ $8300$
admin
asked
in
Operating System
Oct 26, 2019
by
admin
591
views
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
0
votes
0
answers
62
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 6 (Page No. 254)
For each of the following decimal virtual addresses, compute the virtual page number and offset for a $4-KB$ page and for an $8 KB$ page$:20000, 32768, 60000.$
admin
asked
in
Operating System
Oct 26, 2019
by
admin
333
views
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
1
vote
1
answer
63
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 5 (Page No. 254)
What is the difference between a physical address and a virtual address?
admin
asked
in
Operating System
Oct 25, 2019
by
admin
449
views
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
0
votes
2
answers
64
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 15 (Page No. 82)
Consider a computer system that has cache memory, main memory (RAM) and disk, and an operating system that uses virtual memory. It takes $1$ nsec to access a word from the cache, $10$ nsec to access a word from the RAM, and ... and main memory hit rate (after a cache miss) is $99\%$, what is the average time to access a word?
admin
asked
in
Operating System
Oct 23, 2019
by
admin
1.7k
views
tanenbaum
operating-system
virtual-memory
descriptive
3
votes
1
answer
65
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
3
votes
1
answer
66
UGC NET CSE | June 2019 | Part 2 | Question: 47
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by page size physical size of memory the instruction set architecture number of processes in memory
Arjun
asked
in
Operating System
Jul 2, 2019
by
Arjun
1.8k
views
ugcnetcse-june2019-paper2
virtual-memory
paging
0
votes
1
answer
67
Stallings Book Doubt-Process
Which part of the process image forms the logical address space that is used in paging?
aditi19
asked
in
Operating System
May 26, 2019
by
aditi19
514
views
operating-system
process
paging
virtual-memory
0
votes
0
answers
68
Galvin Edition 9 Exercise 9 Question 37 (Page No. 456)
The slab-allocation algorithm uses a separate cache for each different object type. Assuming there is one cache per object type, explain why this scheme doesn’t scale well with multiple CPUs. What could be done to address this scalability issue?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
299
views
galvin
operating-system
virtual-memory
descriptive
0
votes
1
answer
69
Galvin Edition 9 Exercise 9 Question 34 (Page No. 455)
Consider the parameter$\triangle$ used to define the working-set window in the working-set model. When $\triangle$ is set to a small value, what is the effect on the page-fault frequency and the number of active (non suspended) processes currently executing in the system ? What is the effect when $\triangle$ is set to a very high value ?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
1.2k
views
galvin
operating-system
virtual-memory
descriptive
1
vote
1
answer
70
Galvin Edition 9 Exercise 9 Question 33 (Page No. 455)
Is it possible for a process to have two working sets, one representing data and another representing code ? Explain.
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
1.1k
views
galvin
operating-system
virtual-memory
descriptive
0
votes
1
answer
71
Galvin Edition 9 Exercise 9 Question 32 (Page No. 455)
What is the cause of thrashing ? How does the system detect thrashing ? Once it detects thrashing, what can the system do to eliminate this problem ?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
4.8k
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
72
Galvin Edition 9 Exercise 9 Question 31 (Page No. 455)
Consider a demand-paging system with a paging disk that has an average access and transfer time of $20$ milliseconds. Addresses are translated through a page table in main memory, with an access time of $1$ microsecond per memory access. ... $10$ percent (or $2$ percent of the total) cause page faults. What is the effective memory access time?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
514
views
galvin
operating-system
virtual-memory
descriptive
1
vote
0
answers
73
Galvin Edition 9 Exercise 9 Question 30 (Page No. 455)
A page-replacement algorithm should minimize the number of page faults. We can achieve this minimization by distributing heavily used pages evenly over all of memory, rather than having them compete for a small number of page frames. ... faults for an optimal page replacement strategy for the reference string in part $b$ with four page frames?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
845
views
galvin
operating-system
virtual-memory
descriptive
0
votes
1
answer
74
Galvin Edition 9 Exercise 9 Question 29 (Page No. 455)
Suppose that your replacement policy (in a paged system) is to examine each page regularly and to discard that page if it has not been used since the last examination. What would you gain and what would you lose by using this policy rather than LRU or second-chance replacement ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
1.2k
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
75
Galvin Edition 9 Exercise 9 Question 28 (Page No. 455)
Suppose that a machine provides instructions that can access memory locations using the one-level indirect addressing scheme. What sequence of page faults is incurred when all of the pages of a program are currently nonresident and ... system is using a per-process frame allocation technique and only two pages are allocated to this process ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
410
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
76
Galvin Edition 9 Exercise 9 Question 27 (Page No. 455)
Consider a demand-paging system with the following time-measured utilizations: $CPU$ $utilization$ $20$\%$ $Paging$ $disk$ $97.7$\%$ $Other$ $I/O$ $devices$ $5$ ... multiple controllers with multiple hard disks. $g$. Add prepaging to the page-fetch algorithms. $h$. Increase the page size.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
229
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
77
Galvin Edition 9 Exercise 9 Question 26 (Page No. 455)
The VAX/VMS system uses a FIFO replacement algorithm for resident pages and a free-frame pool of recently used pages. Assume that the free-frame pool is managed using the LRU replacement policy. Answer the following questions: a. If a page ... one ? d. What does the system degenerate to if the number of pages in the free-frame pool is zero?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
397
views
galvin
operating-system
virtual-memory
descriptive
0
votes
1
answer
78
Galvin Edition 9 Exercise 9 Question 25 (Page No. 454)
Discuss situations in which the most frequently used ($MFU$) page replacement algorithm generates fewer page faults than the least recently used ($LRU$) page-replacement algorithm. Also discuss under what circumstances the opposite holds.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
1.1k
views
galvin
operating-system
virtual-memory
descriptive
0
votes
1
answer
79
Galvin Edition 9 Exercise 9 Question 24 (Page No. 454)
Discuss situations in which the least frequently used ($LFU$) page replacement algorithm generates fewer page faults than the least recently used ($LRU$) page-replacement algorithm. Also discuss under what circumstances the opposite holds.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
510
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
80
Galvin Edition 9 Exercise 9 Question 23 (Page No. 454)
Assume that you are monitoring the rate at which the pointer in the clock algorithm moves. (The pointer indicates the candidate page for replacement.) What can you say about the system if you notice the following behavior: $a$. Pointer is moving fast. $b$. Pointer is moving slow.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
355
views
galvin
operating-system
virtual-memory
descriptive
0
votes
1
answer
81
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
82
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
83
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
307
views
galvin
operating-system
virtual-memory
page-fault
0
votes
0
answers
84
Galvin Edition 9 Exercise 9 Question 18 (Page No. 453)
A certain computer provides its users with a virtual memory space of $2^{32}$ bytes. The computer has $2^{22}$ bytes of physical memory. The virtual memory is implemented by paging, and the page ... address $11123456$. Explain how the system establishes the corresponding physical location. Distinguish between software and hardware operations.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
374
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
85
Galvin Edition 9 Exercise 9 Question 17 (Page No. 453)
What is the copy-on-write feature, and under what circumstances is its use beneficial ? What hardware support is required to implement this feature ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
374
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
86
Galvin Edition 9 Exercise 9 Question 16 (Page No. 452-453)
Consider a system that uses pure demand paging. $a$. When a process first starts execution, how would you characterize the page-fault rate ? $b$. Once the working set for a process is loaded into memory, how ... large to be stored in available free memory. Identify some options system designers could choose from to handle this situation.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
280
views
galvin
operating-system
virtual-memory
descriptive
0
votes
1
answer
87
Galvin Edition 9 Exercise 9 Question 15 (Page No. 452)
A simplified view of thread states is $Ready$, $Running$, and $Blocked$,where a thread is either ready and waiting to be scheduled, is running on the processor, or is blocked (for example, waiting for I/O). This is illustrated ... the thread change state if an address reference is resolved in the page table? If so, to what state will it change?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
523
views
galvin
operating-system
virtual-memory
translation-lookaside-buffer
descriptive
0
votes
1
answer
88
Galvin Edition 9 Exercise 9 Question 14 (Page No. 452)
Assume that a program has just referenced an address in virtual memory. Describe a scenario in which each of the following can occur. (If no such scenario can occur, explain why.) • $TLB$ miss with no page fault • $TLB$ miss and page fault • $TLB$ hit and no page fault • $TLB$ hit and page fault
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
2.4k
views
galvin
operating-system
virtual-memory
translation-lookaside-buffer
descriptive
0
votes
0
answers
89
Galvin Edition 9 Exercise 9 Question 13 (Page No. 452)
We have an operating system for a machine that uses base and limit registers, but we have modified the machine to provide a page table. Can the page tables be set up to simulate base and limit registers ? How can they be, or why can they not be?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
200
views
galvin
operating-system
virtual-memory
descriptive
0
votes
0
answers
90
Galvin Edition 9 Exercise 9 Question 12 (Page No. 451)
Consider a demand-paged computer system where the degree of multiprogramming is currently fixed at four. The system was recently measured to determine utilization of the CPU and the paging disk. Three alternative results are shown below. For each case, ... $percent$ $c$.$CPU$ $utilization$ $13$ $percent$; $disk$ $utilization$ $3$ $percent$
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
605
views
galvin
operating-system
virtual-memory
descriptive
Page:
« prev
1
2
3
4
5
6
7
8
...
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:...