The principal advantage is a savings in physical memory space. This occurs for two reasons: (1) a user page table can be paged in to memory only when it is needed. (2) The operating system can allocate user page tables dynamically, creating one only when the process is created. Of course, there is a disadvantage: address translation requires extra work.

The principal advantage is a savings in physical memory space. This occurs for two reasons: (1) a user page table can be paged in to memory only when it is needed. (2) The operating system can allocate user page tables dynamically, creating one only when the process is created. Of course, there is a disadvantage: address translation requires extra work.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: What is the process for using virtual machines to safeguard pages of memory?

A: We must describe how virtual memory (VM) is used to offer page-level memory protection. Solution-…

Q: What takes happen if a processor makes a request that cannot be satisfied by the cache while it is…

A: When a processor requests data, the cache is the first place that is checked for the requested data.…

Q: Is there anything that should happen if a processor sends a cache-unfulfilled request while a block…

A: The Cache will be able to meet request because otherwise it is idle, when writing buffer(write…

Q: Memory management is the functionality of an operating system which handles or manages primary…

A: Best Fit Best fit uses the best memory block based on the Process memory request. In best fit…

Q: Memory management is the functionality of an operating system which handles or manages primary…

A: The three algorithms works as: First fit algorithm: In this, each process is allocated to the first…

Q: How does dynamic memory allocation really function when it comes to dividing up available RAM? Can…

A: Dynamic memory allocation: 1. 2. Build time array size may be unknown. Sometimes the array's size is…

Q: What is an example for a cache hit? O The cache hit refers to the data that is most popular, i.e.…

A: Cache Memory : Cache memory component is present between CPU and main memory of the computer. These…

Q: What is the process for using virtual machines to safeguard pages of memory?

A: It is necessary for us to discuss the procedure of using virtual memory (VM) in order to give…

Q: Memory address translation is useful only if the total size of virtual memory (summed over all…

A: Virtual memory address translation is useful even if the total size of the virtual memory (summed…

Q: Which of the following Boolean operations produces the output O for the fewest number of possible…

A: Nand gate contain only one 0 remaining all are 1s. Xor logic contain two zeros only. And logic…

Q: Please let me know if these are true or false! In multiprocessors with a shared physical main…

A: 1)False In the NUMA digital computer model, the interval varies with the placement of the memory…

Q: Can anything go wrong if a CPU issues a cache-unfulfilled request while pushing a block from the…

A: Introduction :- The potential issues that can arise when a CPU issues a cache-unfulfilled request…

Concept explainers

Types of database architectures

A Database Architecture represents the Database Management System’s (DBMS) design (schema). The DBMS architecture makes it easy to understand the components involved in the database system and their relations. The DBMS architecture may vary based on the system on which it runs. Some systems contain both client and server machines whereas some run only on a server machine. Based on the architecture, the system can be classified as centralized, decentralized, or hierarchical.

Question

The principal advantage is a savings in physical memory space.
This occurs for two reasons: (1) a user page table can be paged in
to memory only when it is needed. (2) The operating system can
allocate user page tables dynamically, creating one only when the
process is created. Of course, there is a disadvantage: address
translation requires extra work.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

What should happen when a processor issues a request that cannot be satisfied by the cache while a block is being flushed back to main memory from the write buffer?
Suppose that when run using a single thread, a particular program spends 20 seconds executing code that cannot be parallelized, and 280 seconds executing code that is highly parallelizable. Using Amdahl’s law, give an upper bound on the speedup (ratio of old to new execution time) that might be achieved for this program by exploiting parallel execution on a highly-parallel computer with thousands of processors/cores.
When it comes to allocating resources, how does dynamic memory allocation really function?Can the various types of dynamic memory allocation and allocators be identified and described?
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. Could you hand draw the page table, if possible a) Suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) b) What is the size of the two-level page table
How may Direct Memory Access (DMA) make the system's concurrency better? Does this make it more difficult to produce hardware?
The write buffer will return a block to main memory while the CPU submits a cache-unmet request. What may happen next?
What happens if a processor makes a cache-unfulfilled request while pushing a block back to main memory from the write buffer?
What should happen if the processor provides a request that is not satisfied in the cache while a block is being transferred back to main memory from the write buffer?
When the cache cannot handle a request, the CPU sends the data back to main memory through the write buffer. So, what ought to be done here?