A. If a memory reference takes 200 nanoseconds, how long does a paged memory reference take? B. If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there.)

A. If a memory reference takes 200 nanoseconds, how long does a paged memory reference take? B. If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there.)

Name: Consider a paging system with the page table stored in memory.A. If a
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider a paging system with the page table stored in memory.A. If a memory reference takes 200 nanoseconds, how long does a pagedmemory reference take?B. If we add associative registers, and 75 percent of all page-table referencesare found in the

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

Recently, a computer system was designed by Adam. He considered a paging system assured with a page table stored up in the memory. It was observed that when he used the associative registers, the references made to page tables were around 80 percent. During the whole process, the memory reference taken was about 150 ns. Adam was not sure what was the time taken for paged memory reference. Your task is to help Adam to compute the time for paged memory reference and the time taken for effective memory reference.
Consider a demand-paging system with a paging disk that has an average access and transfer time of 25 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference if the page-table entry is in the associative memory. Assume that 75 percent of the accesses are in the associative memory and that, of those remaining, 10 percent (or 2.5 percent of the total) cause page faults. What is the effective memory access time?
On the Motorola 68020 microprocessor, a cache access takes two clock cycles. Data access from main memory over the bus to the processor takes three clock cycles in the case of no wait state insertion; the data are delivered to the processor in parallel with delivery to the cache. a. Calculate the effective length of a memory cycle given a hit ratio of 0.9 and a clocking rate of 16.67 MHz. b. Repeat the calculations assuming insertion of two wait states of one cycle each per memory cycle. What conclusion can you draw from the results?
Find the base and limit register value for each job in the memory when the order of the job going into the memory is Job 2, Job 4, Job 1, Job 3.Also tell what will happen if CPU request for the base address 306460 and limit address480215. please consider this image for solving the problem
A microprocessor scans the status of an output I/O device every 20 ms. This is accom- plished by means of a timer alerting the processor every 20 ms. The interface of the device includes two ports: one for status and one for data output. How long does it take to scan and service the device given a clocking rate of 8 MHz? Assume for sim- plicity that all pertinent instruction cycles take 12 clock cycles.
Consider a demand-paging system with a paging disk that has an average access/transfer time of 50 ms. Addresses are translated through a page table in main memory, with an access time of 500 ns per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added a TLB that reduces access time to one memory reference if the page-table entry is in the TLB. Assume that 80% of the accesses are in the TLB and that, of those remaining, 15% (or 3% of the total) cause page faults. We assume that the TLB access time is 20 ns. What is the effective access time?
Q2:- (A) Find the phicycal address if (BP) = 0100H , (SI) = 0200H , (SS) = 2000H and a displacement of 10H, of the instruction MOV AL, [BP+SI+10H]. Which the name of Addressing Modes?
Registers in RISC-V are 64-bit. For the sake of simplicity, consider the following instructions operating on 32-bit registers. Assume that registers x5 and x6 hold the values 0xBBBBBBBB and 0x00000000, respectively. What is the value in x6 for the followingslli x6, x5, 6 Using the result from the part above, what is the value in x6 for the following instruction. srli x6, x6, 6
Two interrupts have execution times of 7.5us and 10 us. Both occur at the same rate, Find the maximum frequency that they can occur to maintain a combined CPU% less than 1.5%?
Consider the image attached that represents part of the memory of a 16-bit address space that has an addressability of 2 bytes. In the von Neumann model, the contents of a memory location can also be interpreted as an instruction. E.) Interpret the contents at address 0x0C0E as an LC-3 instruction to determine the operation. (Enter either ADD, JMP, LDR, or OTHER if it is not one of the first 3) F.) Interpret the contents at address 0x0C0F as an LC-3 instruction to determine the operation. (Enter either ADD, JMP, LDR, or OTHER if it is not one of the first 3) A memory location can store an address. We call that memory location's contents a "pointer" since it's an address that "points" to another memory location. G.) Interpret the contents at address 0x0C0B as a pointer. (Enter hex like the following example: 0x2A3F) H.) What are the contents of the memory location that the pointer above is pointing to? (Enter hex like the following example: 0x2A3F) Another reference : LC-3…
Question 4: There is an application that requires the hardware: an Intel 8031, a Program ROM of 8Kx8, a Data ROM of 4Kx8 for look-up tables, TWO Data RAMs of 8Kx8. The memory map of the design should be: Program ROM should start at address 0000μ. Then, the Data ROM should come above the Program ROM. Finally the Data RAMs must go to the top of the memory map. There should be no gaps between the memory addresses of the external ROMs or RAMS. A. Using logic gates, draw the pin connections of the design. Label your diagram fully. B. Calculate the address space of the ROMs and RAMs of your design. C. Show the design's address space on a memory map, starting with 0000μ at the bottom and FFFFH at the top.
Consider an array (arr) and the registers R1,R2,R3. Give the statement that can find the next address of the arr. (R2 is for the index of the array, R3 will have this address)