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

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?)
the control bus carries signals that report the status of I/O devices. * True O False the control unit issues a set of signals in each control step and the CPU to go through a sequence of these control steps. True False Itanium have 64 address lines Could address 2^64 bytes of memory. * True O False
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
Suppose the page table for the process currently executing on the processor looks like the following. All numbers are decimal, everything is numbered starting from zero, and all addresses are memory byte addresses. The page size is 1024 bytes. Virtual page number 0 1 2 3 4 5 Valid bit 1 1 0 1 0 1 (ii) 2221 (iii) 5499 Reference bit 1 1 0 0 0 0 Modify bit 0 1 0 0 0 1 Page frame number 4 7 - 2 0 a. Describe exactly how, in general, a virtual address generated by the CPU is trans- lated into a physical main memory address. b. What physical address, if any, would each of the following virtual addresses corre- spond to? (Do not try to handle any page faults, if any.) (i) 1052
When feasible, what advantages does it have to move process execution to the I/O queue first? Should the I/O connection go down, what do you anticipate would happen? Will this reduce the CPU's maximum burst frequency in any way? Not sure I understand what you mean by that.
In a system where a single-level page table is maintained and no other support mechanism exists, exactly two memory accesses will be required to complete the process of adding a constant number to a value in a register of the CPU. (a) True (b)False
Which memory address in Interrupt Vector Table (IVT) stores the higher byte of the segment part forthe beginning address of ISR that corresponds to ITC 15 H? Justify your answer with calculation. give diagram if needed
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?
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:
Assume that an interrupt mechanism uses the hardware stack to store PC and other registers of the interrupted computations. The interrupt mechanism recognizes 4 interrupt vectors IV [1], IV [2], IV [3], IV [4] initialized by addresses of their corresponding ISR I =1..4. The elements of the hardware stack are a record R, where each field stores a specific CPU register (R.PC is the field, which stores the program counter PC and so on). The Hardware stack is manipulated using the standard stack operation Pop, Push, EmptyStack.a) Explain how the CPU detects an interrupt signal I and what actions should be taken?b) Write the initial and final sequences of instruction of a given ISR I (Transparency).c) Write the ISR4 such that whatever number of interrupted computation (in the stack) it gives the control to the first one interrupted.
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?