Suppose that a machine provides instructions that can access memory locations using the one-level indirect addressing scheme. What is the sequence of page faults incurred when all of the pages of a program are currently non-resident and the first instruction of the program is an indirect memory load operation? What happens when the operating system is using a per-process frame allocation technique and only two pages are allocated to this process?

Suppose that a machine provides instructions that can access memory locations using the one-level indirect addressing scheme. What is the sequence of page faults incurred when all of the pages of a program are currently non-resident and the first instruction of the program is an indirect memory load operation? What happens when the operating system is using a per-process frame allocation technique and only two pages are allocated to this process?

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: A paged memory is shared by two processes, p1 and p2. 16 24 15 1 3 -2 9 -3 17 -12 25 -3 18 -16 19 10…

A: Answer

Q: , 25% reads and 10% writes, and every other instruction type is 1 cycle. You have a 2-way set…

A: since addresses size supported by the hardware's is 40bit's total size of the main memory is 240…

Q: Look at the figure, can you explain to me from the figure the following special registers in the…

A: PC: Program counter holds the address of the instruction which is currently being executed. NPC:…

Q: Q4. Consider a paging system with the page table stored in memory. Answer and explain the following.…

A: Computer operating systems employ paging, a memory management technique, to control and arrange the…

Q: Consider a computer system that uses virtual memory with paging (no TLB). Suppose main access time…

A: Paging technique means dividing virtual memory into equal size partitions called pages and storing…

Q: Suppose memory holds the following data values in these addresses: Address: Data: 1000: 25 1004: 33…

A: This is has used the concept of index addressing mode. Here is the explanation:

Q: a. Describe exactly how, in general, a virtual address generated by the CPU is trans- lated into a…

A: Answer: a) A Virtual address generated by the CPU is translated into physical main memory address by…

Q: An action that results in the allocation of a demand-free memory area would only be requested by a…

A: An action that results in the allocation of a demand-free memory area would only be requested by a…

Q: Suppose we define a service routine starting at memory location x4000. This routine reads in a…

A: Given: As per the policy we can answer single question at time , but i answering 1st and 4th for…

Q: ve a two-level page table where the first level is indexed by 15-bits, then how many entries does…

A: Dear Student, The answer to your questions is given below -

Q: A system is using segmentation without paging. • The segment table of the currently executing…

A: The above question is solved in step 2:-

Q: Consider a computer which uses virtual addressing with 32 bit addresses and a two level page table.…

A: The size of the pages in this virtual addressing scheme can be determined by looking at the number…

Q: Computer Science Suppose for a processor system it takes 35 cycles to push and pop registers onto…

A: Suppose for a processor system it takes 35 cycles to push and pop registers onto the stack and…

Q: Given a system with 32 bits logical address and paging is used for memory management, the page size…

A: A logical address is a virtual address that is generated by the CPU and used by a program or process…

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: Loading a piece of data from memory into the CPU's register, all instructions must be fetched before…

A: Here is the answer with an explanation:-

Q: Given the MARIE assembly language program below, after assembling and before executing, provide the…

A: It is defined as ('Machine Architecture that is Really Intuitive and Easy') that is a machine…

Q: Idress. process P is associated with a Base Register = 200 and a Limit Register = 100 ocess P…

A: Here the base register is 200 The value of limit register is 100 > logical address. Thus no…

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

Suppose that a machine provides instructions that can access memory locations
using the one-level indirect addressing scheme. What is the sequence of page
faults incurred when all of the pages of a program are currently non-resident
and the first instruction of the program is an indirect memory load operation?
What happens when the operating system is using a per-process frame
allocation technique and only two pages are allocated to this process?

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 is: a type of branch type of hardware multithreading in which instructions from multiple different threads can be issued in the same clock cycle? (I'm assuming this is superscalar? or is it coarse-grained?) a method for communicating with the I/O devices in which registers within the I/O device interfaces can be accessed using ordinary store and load instructions? a type of branch instruction with which come fixed number of sequentialy following instructions are executed regardless of the outcome of the branch test? The process of making the result of an instruction permanent by writing into memory or the register file a type of processor architecture in which the same operation can be applied to many different pairs of values using a single machine language instruction (... multithreading? MIMD?)
A system uses Relocation and Limit Registers to map virtual addresses to physical addresses. A process P has a Relocation Register = 100 and a Limit Register = 200. This process has generated a logical address of 17, then the system maps this address to a physical address of: Select one: O 217 O 117 O 17 O This address generates an addressing error
Consider a virtual memory system with the following characteristics for accessing memory: 1 nanosecond for a read operation with a hit in cache 5 nanoseconds for a read operation with a miss in cache 2 nanoseconds for a write operation with a hit in cache 10 nanoseconds for a write operation with a miss in cache The cache hit ratio is 0.9 If a sequence of instructions were executed: 100 instruction fetch operations, 60 memory operand read operations, and 40 memory operand write operations, what would be the average memory access time (in nanoseconds) in executing the sequence of instructions:
Consider a system with 256Mbytes of main memory with page size of 4Kbytes. It has a logical address space of 26-bits. Answer the following questions. (Assume byte-addressable memory) (i) How many of the 26-bits of the logical address represent page# and how many bits represent the offset? (ii) How many entries are there in a conventional single-level page table for a process? (iii) How many entries are there in an inverted page table?