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 paging
0
votes
0
answers
91
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 26 (Page No. 256)
A student in a compiler design course proposes to the professor a project of writing a compiler that will produce a list of page references that can be used to implement the optimal page replacement algorithm. Is this possible? Why or why not? Is there anything that could be done to improve paging efficiency at run time?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
306
views
tanenbaum
operating-system
memory-management
paging
page-replacement
descriptive
1
vote
4
answers
92
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 24 (Page No. 256)
A machine has $48-bit$ virtual addresses and $32-bit$ physical addresses. Pages are $8\: KB.$ How many entries are needed for a single-level linear page table?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
702
views
tanenbaum
operating-system
memory-management
paging
descriptive
0
votes
0
answers
93
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 23 (Page No. 256)
How can the associative memory device needed for a $TLB$ be implemented in hardware, and what are the implications of such a design for expandability?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
275
views
tanenbaum
operating-system
memory-management
paging
translation-lookaside-buffer
descriptive
1
vote
1
answer
94
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 22 (Page No. 256)
A computer whose processes have $1024$ pages in their address spaces keeps its page tables in memory. The overhead required for reading a word from the page table is $5\: nsec.$ To reduce this overhead, the computer has a $TLB,$ ... a lookup in $1\: nsec.$ What hit rate is needed to reduce the mean overhead to $2\: nsec?$
admin
asked
in
Operating System
Oct 26, 2019
by
admin
775
views
tanenbaum
operating-system
memory-management
paging
translation-lookaside-buffer
descriptive
1
vote
0
answers
95
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 21 (Page No. 256)
Below is an execution trace of a program fragment for a computer with $512-byte$ pages. The program is located at address $1020,$ and its stack pointer is at $8192\:\:($the stack grows toward $0).$ Give the ... $16$ from the stack pointer Compare the actual parameter to the immediate constant $4$ Jump if equal to $5152$
admin
asked
in
Operating System
Oct 26, 2019
by
admin
440
views
tanenbaum
operating-system
memory-management
paging
descriptive
0
votes
1
answer
96
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 20 (Page No. 256)
A computer has $32-bit$ virtual addresses and $4-KB$ pages. The program and data together fit in the lowest page $(0-4095)$ The stack fits in the highest page. How many entries are needed in the page table if ... paging is used? How many page table entries are needed for two-level paging, with $10$ bits in each part?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
539
views
tanenbaum
operating-system
memory-management
paging
descriptive
4
votes
4
answers
97
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 19 (Page No. 256)
A computer with a $32-bit$ address uses a two-level page table. Virtual addresses are split into a $9-bit$ top-level page table field, an $11-bit$ second-level page table field, and an offset. How large are the pages and how many are there in the address space?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
2.6k
views
tanenbaum
operating-system
memory-management
multilevel-paging
paging
descriptive
0
votes
0
answers
98
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 18 (Page No. 256)
Section $3.3.4$ states that the Pentium Pro extended each entry in the page table hierarchy to $64$ bits but still could only address only $4\: GB$ of memory. Explain how this statement can be true when page table entries have $64$ bits.
admin
asked
in
Operating System
Oct 26, 2019
by
admin
306
views
tanenbaum
operating-system
memory-management
paging
descriptive
1
vote
1
answer
99
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 17 (Page No. 255)
Suppose that a machine has $438-bit$ virtual addresses and $32-bit$ physical addresses. What is the main advantage of a multilevel page table over a single-level one? With a two-level page table, $16-KB$ pages, ... should be allocated for the top-level page table field and how many for the next level page table field? Explain.
admin
asked
in
Operating System
Oct 26, 2019
by
admin
2.3k
views
tanenbaum
operating-system
memory-management
paging
descriptive
2
votes
1
answer
100
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 15 (Page No. 255)
Suppose that a machine has $48-bit$ virtual addresses and $32-bit$ physical addresses. If pages are $4\: KB$, how many entries are in the page table if it has only a single level? Explain. Suppose this same ... long integer elements from an array that spans thousands of pages. How effective will the $TLB$ be for this case?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
1.9k
views
tanenbaum
operating-system
memory-management
paging
descriptive
2
votes
1
answer
101
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 14 (Page No. 255)
A machine has a $32-bit$ address space and an $8-KB$ page. The page table is entirely in hardware, with one $32-bit$ word per entry. When a process starts, the page table is copied to the hardware from memory, ... including the time to load the page table), what fraction of the $CPU$ time is devoted to loading the page tables?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
367
views
tanenbaum
operating-system
memory-management
paging
descriptive
1
vote
2
answers
102
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
1
vote
1
answer
103
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 11 (Page No. 255)
Consider the following C program: int X[N]; int step = M; /* M is some predefined constant */ for (int i = 0; i < N; i += step) X[i] = X[i] + 1; If this program is run on a machine with ... for every execution of the inner loop? Would your answer in part $(a)$ be different if the loop were repeated many times? Explain.
admin
asked
in
Operating System
Oct 26, 2019
by
admin
556
views
tanenbaum
operating-system
memory-management
paging
translation-lookaside-buffer
descriptive
0
votes
1
answer
104
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 9 (Page No. 255)
What kind of hardware support is needed for a paged virtual memory to work?
admin
asked
in
Operating System
Oct 26, 2019
by
admin
364
views
tanenbaum
operating-system
memory-management
virtual-memory
paging
descriptive
3
votes
1
answer
105
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
1
vote
3
answers
106
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
Hirak
asked
in
Operating System
Jun 13, 2019
by
Hirak
1.7k
views
memory-management
paging
operating-system
multilevel-paging
self-doubt
2
votes
1
answer
107
IISc CSA Written Test 2019
Given that a computer system has only 3 process.1st process is single threaded, 2nd process is two threaded and 3rd process is 4 threaded.So total how many number of page tables will be managed by the operating system?
Sourajit25
asked
in
Operating System
Jun 4, 2019
by
Sourajit25
644
views
operating-system
paging
iisc
threads
0
votes
1
answer
108
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
513
views
operating-system
process
paging
virtual-memory
1
vote
2
answers
109
Mode of OS during page table access
What is the mode(User/Kernel) of the Operating System when a Page Table or TLB are being accessed?
!KARAN
asked
in
Operating System
May 18, 2019
by
!KARAN
589
views
memory-management
paging
operating-system
2
votes
0
answers
110
Vani Question Bank:Operating System
Hirak
asked
in
Operating System
May 9, 2019
by
Hirak
262
views
operating-system
page-replacement
page-fault
paging
1
vote
1
answer
111
ISI2017-PCB-CS-5(b)
Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Translation Lookaside Buffer (TLB) and $75$ percent of all page-table references are ... memory reference time? Assume that finding a page-table entry in the TLB takes $20$ nanoseconds, if the entry is present.
akash.dinkar12
asked
in
Operating System
Apr 8, 2019
by
akash.dinkar12
7.8k
views
isi2017-pcb-cs
operating-system
paging
translation-lookaside-buffer
descriptive
1
vote
0
answers
112
Galvin Edition 9 Exercise 9 Question 38 (Page No. 456)
Consider a system that allocates pages of different sizes to its processes. What are the advantages of such a paging scheme ? What modifications to the virtual memory system provide this functionality ?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
714
views
galvin
operating-system
memory-management
paging
0
votes
0
answers
113
Paging
What is the difference between present - absent bit and valid - invalid bit in a page table ?
vivek gupta 3
asked
in
Operating System
Feb 18, 2019
by
vivek gupta 3
641
views
operating-system
paging
0
votes
0
answers
114
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
0
votes
0
answers
115
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
672
views
operating-system
paging
virtual-memory
0
votes
0
answers
116
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
261
views
operating-system
virtual-memory
paging
effective-memory-access
self-doubt
1
vote
2
answers
117
Applied Course | Mock GATE | Test 1 | Question: 49
How much memory is used for page tables, when there are $10$ process running in the system with the below details? Virtual Address space: $1GB$ Page size: $1KB$ Each page table entry contains a valid bit, dirty bit and the resulting frame number. And the system has a maximum of $2^{14}$ physical pages. $10$ MB $20$ MB $30$ MB None of these
Applied Course
asked
in
Operating System
Jan 16, 2019
by
Applied Course
731
views
applied-course-2019-mock1
operating-system
memory-management
paging
0
votes
0
answers
118
TLB misses
1 2 2048 none
gate_forum
asked
in
Operating System
Jan 13, 2019
by
gate_forum
278
views
operating-system
translation-lookaside-buffer
paging
2
votes
0
answers
119
Ace Test Series: Operating System - Virtual Memory
amitqy
asked
in
Operating System
Jan 12, 2019
by
amitqy
811
views
operating-system
virtual-memory
paging
memory-management
ace-test-series
2
votes
1
answer
120
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
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 paging
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:...