Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged memory-management
1
votes
0
answers
151
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 31 (Page No. 257)
Give a simple example of a page reference sequence where the first page selected for replacement will be different for the clock and $LRU$ page replacement algorithms. Assume that a process is allocated $3=\text{three}$ frames, and the reference string contains page numbers from the set $0, 1, 2, 3.$
Give a simple example of a page reference sequence where the first page selected for replacement will be different for the clock and $LRU$ page replacement algorithms. As...
admin
340
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
page-replacement
least-recently-used
descriptive
+
–
0
votes
0
answers
152
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 30 (Page No. 257)
A small computer on a smart card has four page frames. At the first clock tick, the $R$ bits are $0111\:\: ($page $0$ is $0,$ the rest are $1).$ ... $8-bit$ counter, give the values of the four counters after the last tick.
A small computer on a smart card has four page frames. At the first clock tick, the $R$ bits are $0111\:\: ($page $0$ is $0,$ the rest are $1).$ At subsequent clock ticks...
admin
424
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
page-replacement
descriptive
+
–
0
votes
0
answers
153
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 29 (Page No. 257)
Consider the page sequence of Fig. $3-15(b)$. Suppose that the $R$ bits for the pages $B$ through $A$ are $11011011,$ respectively. Which page will second chance remove?
Consider the page sequence of Fig. $3-15(b)$. Suppose that the $R$ bits for the pages $B$ through $A$ are $11011011,$ respectively. Which page will second chance remove?
admin
310
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
page-replacement
descriptive
+
–
0
votes
0
answers
154
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 28 (Page No. 257)
If $FIFO$ page replacement is used with four page frames and eight pages, how many page faults will occur with the reference string $0172327103$ if the four frames are initially empty? Now repeat this problem for$ LRU.$
If $FIFO$ page replacement is used with four page frames and eight pages, how many page faults will occur with the reference string $0172327103$ if the four frames are in...
admin
433
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
page-replacement
descriptive
+
–
0
votes
0
answers
155
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 27 (Page No. 256 - 257)
Suppose that the virtual page reference stream contains repetitions of long sequences of page references followed occasionally by a random page reference. For example, the sequence ... replacement approach that would perform much better than the $\text{LRU, FIFO, or clock} $ algorithms.
Suppose that the virtual page reference stream contains repetitions of long sequences of page references followed occasionally by a random page reference. For example, th...
admin
320
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
page-replacement
descriptive
+
–
0
votes
0
answers
156
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?
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 ...
admin
302
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-replacement
descriptive
+
–
0
votes
0
answers
157
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 25 (Page No. 256)
A computer with an $8-KB$ page, a $256-KB$ main memory, and a $64-GB$ virtual address space uses an inverted page table to implement its virtual memory. How big should the hash table be to ensure a mean hash chain length of less than $1?$ Assume that the hash table size is a power of two.
A computer with an $8-KB$ page, a $256-KB$ main memory, and a $64-GB$ virtual address space uses an inverted page table to implement its virtual memory. How big should th...
admin
478
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
inverted-page-table
descriptive
+
–
1
votes
4
answers
158
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?
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
687
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
0
votes
0
answers
159
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?
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
273
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
translation-lookaside-buffer
descriptive
+
–
1
votes
1
answer
160
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?$
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\:...
admin
752
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
translation-lookaside-buffer
descriptive
+
–
1
votes
0
answers
161
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$
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\:\:($t...
admin
435
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
0
votes
1
answer
162
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?
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...
admin
536
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
4
votes
4
answers
163
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?
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...
admin
2.6k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
multilevel-paging
paging
descriptive
+
–
0
votes
0
answers
164
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.
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...
admin
304
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
1
votes
1
answer
165
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.
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 ...
admin
2.3k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
1
votes
2
answers
166
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 16 (Page No. 255)
You are given the following data about a virtual memory system: The $TLB$ can hold $1024$ entries and can be accessed in $1$ clock cycle $(1\: nsec).$ A page table entry can be found in $100$ ... $0.01\%$ lead to a page fault, what is the effective address-translation time?
You are given the following data about a virtual memory system:The $TLB$ can hold $1024$ entries and can be accessed in $1$ clock cycle $(1\: nsec).$ A page table entry c...
admin
618
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
translation-lookaside-buffer
descriptive
+
–
2
votes
1
answer
167
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?
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 singl...
admin
1.9k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
2
votes
1
answer
168
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?
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...
admin
363
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
1
votes
2
answers
169
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.
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...
admin
1.6k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
0
votes
2
answers
170
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 12 (Page No. 255)
The amount of disk space that must be available for page storage is related to the maximum number of processes$,\: n,$ the number of bytes in the virtual address space, $v,$ and the number of bytes of $RAM,\: r$. Give an expression for the worst-case disk-space requirements. How realistic is this amount?
The amount of disk space that must be available for page storage is related to the maximum number of processes$,\: n,$ the number of bytes in the virtual address space, $...
admin
1.1k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
1
votes
1
answer
171
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.
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 ...
admin
555
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
translation-lookaside-buffer
descriptive
+
–
0
votes
0
answers
172
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 10 (Page No. 255)
Copy on write is an interesting idea used on server systems. Does it make any sense on a smartphone?
Copy on write is an interesting idea used on server systems. Does it make any sense on a smartphone?
admin
145
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
1
answer
173
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?
What kind of hardware support is needed for a paged virtual memory to work?
admin
354
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
paging
descriptive
+
–
0
votes
0
answers
174
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 8 (Page No. 254)
The Intel $8086$ processor did not have an MMU or support virtual memory. Nevertheless, some companies sold systems that contained an unmodified $8086$ CPU and did paging. Make an educated guess as to how they did it. (Hint: Think about the logical location of the MMU.)
The Intel $8086$ processor did not have an MMU or support virtual memory. Nevertheless, some companies sold systems that contained an unmodified $8086$ CPU and did paging...
admin
324
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
1
votes
0
answers
175
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$
Using the page table of Fig. $3-9,$ give the physical address corresponding to each of the following virtual addresses:$20$$4100$$8300$
admin
585
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
0
votes
0
answers
176
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.$
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
327
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
1
votes
1
answer
177
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?
What is the difference between a physical address and a virtual address?
admin
440
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
1
votes
2
answers
178
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 4 (Page No. 254)
Consider a swapping system in which memory consists of the following hole sizes in memory order: $10\: MB, 4\: MB, 20\: MB, 18\: MB, 7\: MB, 9\: MB, 12\: MB,$ and $15\: MB$. Which hole is taken for successive segment ... $10\: MB$ $9\: MB$ for first fit? Now repeat the question for best fit, worst fit, and next fit.
Consider a swapping system in which memory consists of the following hole sizes in memory order: $10\: MB, 4\: MB, 20\: MB, 18\: MB, 7\: MB, 9\: MB, 12\: MB,$ and $15\: M...
admin
6.0k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
2
answers
179
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 3 (Page No. 254)
A swapping system eliminates holes by compaction. Assuming a random distribution of many holes and many data segments and a time to read or write a $32-bit$ memory word of $4\:nsec$, about how long does it take to ... simplicity, assume that word $0$ is part of a hole and that the highest word in memory contains valid data.
A swapping system eliminates holes by compaction. Assuming a random distribution of many holes and many data segments and a time to read or write a $32-bit$ memory word o...
admin
1.3k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
1
answer
180
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 2 (Page No. 254)
In Fig. $3-3$ the base and limit registers contain the same value, $16,384$. Is this just an accident, or are they always the same? It is just an accident, why are they the same in this example?
In Fig. $3-3$ the base and limit registers contain the same value, $16,384$. Is this just an accident, or are they always the same? It is just an accident, why are they t...
admin
1.5k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
16
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register