If memory access time is 200 nano seconds and average page-fault service time = 8 milliseconds, and if you want a performance degradation of less than 20 percent, in at least how many memory accesses a page fault may be endured to occur?answera)one page-fault in 7999800 memory accesses at mostb)20 page-fault in 100 memory accesses at mostc)one page-fault in 400000 memory accesses at mostd)one page-fault in 199995 memory accesses at most

Memory Access time = 200ns Page fault service time = 8ms EAT = (1-p)x 200+p( 8 x 10^6) Performance…

If memory access time is 200 nano seconds and average page-fault service time = 8 milliseconds, and if you want a performance degradation of less than 20 percent, in at least how many memory accesses a page fault may be endured to occur?

If memory access time is 200 nano seconds and average page-fault service time = 8 milliseconds, and if you want a performance degradation of less than 20 percent, in at least how many memory accesses a page fault may be endured to occur?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Related questions

Q: In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary…

A: Introduction : Given, paged memory page hit ratio=0.40 second memory…

Q: (b) Consider a system with multiple level memory as in Table Q520. Table Q52 (i) (ii) Component…

A: Please refer below for your reference: The average Memory access time for this system is given as :…

Q: A computer has a level 1 cache with an access time of 2 cycles and an average hit rate of 90% and…

A: we are not allow to gave nswer for all as per gideline , so please reupload rest of them:

Q: In a three level memory hierarchy, the access time of cache, main and virtual memory is 5…

A: data: Cache = T1 = 5 ns Hit ratio = p = 0.8 Miss ratio = 1 - p = 1 - 0.8 = 0.2 Main memory Main…

Q: 1. Given the hit ratio of level-1 cache is 0.1 and the access time is 1, the hit ratio of level-2…

A: Given that, level-1 cache Hit ratio = 0.1 level-1 cache access time=1 level-2 cache hit ratio= 0.2…

Q: empty page is available or the replaced page is not modified, and 20 percent of the time. What is…

A: In this question, we are asked to find out maximum page fault rate with the given data Given: Time…

Q: Problem: Suppose that a computer has a processor with two L1 caches, one for instructions and one…

A: Basics :- Consider a system with only one level of cache. In this case, the miss penalty…

Q: a cache access requires one clock cycle and dealing with cache misses requires an additional five…

A: The cache memory is a small sized memory which provides fast access to data. The data that is…

Q: Calculate the effective access time for a demand-paged memory given a memory access time of 100…

A: Effective memory access time = page fault rate * {page fault service time + access time without page…

Q: Assume the cache miss penalty is 100 clock cycles and all instructions normally take 1.0 clock…

A: The Answer is

Q: Write down the expression for the average memory access time for a system with two levels of caches…

A: Step 1: As mentioned in the question, we have two levels of caches. So let us assume, 1st level of…

Q: Assume that we have a demand-paged memory. The page table is held in registers. It takes 10…

A: Here is the solution:

Q: Consider a cache memory with blocks of 23 = words (1 word = 4 bytes) , with a bus Main Memory -…

A: Given Data : Block size = 8 words 1 word = 4 bytes Cache bits = 32 bits Address sending time = 1…

Q: Assume that we have a demand-paged memory. The page table is held in registers. It takes 8…

A: Introduction :Given , Page fault service time = 8 ms service time if page is modified = 20 ms memory…

Q: Assume a process containing 5 pages with 1024 bytes per page and physical memory with 10 page…

Q: If memory read cycle takes 100 ns and a cache read cycle takes 20 ns, then for four continuous…

A: Memory Read cycle : 100nsCache Read cycle : 20ns Four continuous reference is done - one reference…

Q: Let's say in a system, it takes 8 milliseconds to service a page fault if an empty page is available…

A: Introduction :Given , Page fault service time = 8 ms service time if page is modified = 20 ms memory…

Q: Need correct answer only upvote otherwise downvotes If the main memory access time is Ims and page…

A: The answer for effective access time is

Q: The arrival time for processes A,B,C and D is 0,2,4, and 5 while the required CPU burst time is…

A: Given data for calculating average turn-around time are, Arrival time for the processes A,B,C,D…

Q: Let the page fault service time be 10 ms in a computer with average memory access time being 20 ns.…

A: Correct answer is 30 ns

Q: Assume we have a demand-paged memory. The page table is held in registers. It takes 3 milliseconds…

A: Effective Access Time = (1 - p) * (memory access time) + p * (1 - pm) * (page fault service with no…

Q: What is the effective memory access time if the memory access time is 450 ns and a page fault takes…

A: Effective access time The 'effective access time' is essentially the (weighted) average time it…

Q: Consider a system with 2 level cache. Access times of Level 1 cache, Level 2 cache and main memory…

A: Introduction :

Q: Consider a cache memory with blocks of 23 words (1 word = 4 bytes) , with a bus Main Memory - Cache…

A: SUMMARY: -Hence, we discussed all the points

Q: If memory access time is 200 nanoseconds and average page-fault service time is 8 milliseconds, and…

A: If memory access time is 200 nanoseconds and average page-fault service time is 8 milliseconds,…

Q: Suppose the cache access time is 1 ns, main memory access time is 100 ns and the cache hit rate is…

A: Effective Memory Time = cache hit rate * cache access time + cache miss rate ( cache access time +…

Q: onsider a system with 3 I/O devices Printer (priority of 2) Disk (priority of 4) Communication line…

A: Interrupt Interrupt is a signal raised by software or hardware to get immediate attention of…

Q: You are given the following data about a virtual memory system: (a)The TLB can hold 1024 entries and…

A: consider the memory access time =1 clock cycle or 1 ns. we can write effective address translation…

Q: Let the page fault service time be 10 ms in a computer with average memory access time being 20 ns.…

A: It is given that viable memory access time without page shortcoming = 20 ns. Presently, subbing…

Q: Consider a 512 KB cache system used in our laptop. The access time for the cache is 25 ns, and the…

A: Your answer is given below in detail.

Q: Consider a computer system with DMA support. The DMA module is transferring one 8-bit character in…

A: Introduction :given , computer system with DMA support1 char(8 bits) take = 1 clock cyclefrequency =…

Q: n Paging, for CPU requests there are two access times, one for accessing page table and one for…

A: In Paging, for CPU requests there are two access times, one for accessing page table and one for…

Q: pose a computer using fully associative cache has 2MB of byte-addressable main memory and a he of…

A: A) Total number of main memory block = Main memory size /block size = 2^21/2^5 = 2^16 B) Size of…

Q: Assume a computer has on-chip and off-chip caches, main memory and virtual memory. Assume the…

A: Virtual memory is a popular technique used in the operating systems (OS) of computers. Virtual…

Q: Consider a system with 4GB of memory address space. Assuming a write-back policy and block size of…

A: Memory size = 32 bits. A. Total # of cache blocks = 2K So index bits = 11 bits Offset bits = 5…

Q: A memory system consists of a cache with a hit time of 5 nsec, if the miss penalty is 100 nsec and…

A: Here we calculate the Cache hit rate by using the given information and correct the answer , so the…

Q: Consider a swapping system in which memory consists of the following hole sizes in memory order: 12…

A: Given memory hole sizes are, 12 MB, 4 MB, 20 MB, 12 MB, 18 MB, 7 MB, 9 MB and 12 MB Given segment…

Q: Assume the following parameters for a shadow paging system. TLB Misses per1000 Instructions NPT…

Q: 11. Suppose the time to service a page fault is on the average 10 milliseconds, while a memory…

A: Introduction

Q: Assuming a base CPI of 1.0 without any memory stalls, what is the total CPI for P1 with the addition…

A: Given: Base CPI=1.0 Assumption: Assume that main memory accesses take 70 ns. Assume that, number of…

Q: Operating System: Consider a demand-paging system with a paging disk. The average disk access time…

A: Operating System: Consider a demand-paging system with a paging disk. The average disk access…

Q: (b) Consider a system with multiple level memory as in Table Q52 Table Q52 (i) (ii) Component Cache…

A: Please refer below for your reference: The average Memory access time for this system is given as :…

Q: Assume a swapping system in which memory consists of the following hole sizes in memory and in order…

A: Lets see the detailed answer to this question.

Q: 1 cache is 0.5 and the access time is 50ns, the hit ratio of level-2 cache is 0.3 and the access…

A: 5. Given that the hit ratio of level-1 cache is 0.5 and the access time is 50ns, the hit ratio of…

Q: If a processor has a CPI of 2 without any memory stalls, and the miss penalty is 100 cycles for all…

A: solution :

Q: In paging (given diagram), for CPU request there are two access time one for accessing page table…

A: In paging (given diagram), for CPU request there are two access time one for accessing page table…

Q: Given that the hit ratio of level-1 cache is 0.5 and the access time is 50ns, the hit ratio of…

A: Answer is given below. The level 1 cache hit rate is 0.5, the access time is 50 ns, the level 2…

Q: You are given the following data about a virtual memory system: (a) The TLB can hold 512 entries and…

A: The chance of a hit is 0.99 for the TLB and the access time for TLB is 1 nsec. So, the term will be…

Q: Consider a process with 4GB logical memory, 4KB page size, and a page table whose entry is 4B each.…

A: We are given logical memory size, page size and size of each page table entry. We need to find which…

Concept explainers

Fundamentals of Input and Output Performance

The I/O subsystem is a component of computer system design that uses buses to assist communication between the Central Processing Unit, Computer Memory/Storage, and Input and Output Devices (that is known as peripheral devices). The I/O subsystem includes disc controllers, tape drives, discs, system buses, and other devices. The I/O database application reads and writes drives using the operating system windows I/O.

Question

100%

answer

a)one page-fault in 7999800 memory accesses at most

b)20 page-fault in 100 memory accesses at most

c)one page-fault in 400000 memory accesses at most

d)one page-fault in 199995 memory accesses at most

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

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Input and Output Performance

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

A computer system has a memory access time of 11.0 ns and is using a SATA III SSD (solid state drive) capable of transferring 8 Gbit/s. The size of a page is 1024 bytes. What should the probability of a page fault be so that access time degradation does not exceed 14%?
If memory read cycle takes 100 ns and a cache read cycle takes 20 ns, then for four continuous references, the first one brings the main memory contents to cache and the next three from cache. Find the time taken for the Read cycle with and without Cache? What is the Percentage speedup obtained?
Calculate the effective access time for a demand-paged memory given a memory access time of 100 nanoseconds, a page fault service time of 6,000,000 nanoseconds, and a page-fault rate of 1 page fault out of every 10,000 access attempts.
I am trying to better understand memory access in computers, please answer the sample question below. Assume that the page table can held in registers of the MMU. It takes 8 ms (milliseconds)to service a page fault if there is an empty frame or if the replaced page is not altered, and20 ms if the replaced page is altered. Memory access time is 100 ns (nanoseconds). It has been empirically measured that the page to be replaced is altered 75% of the time.Obtain the maximum probability of page fault for an effective memory access time ≤ 200ns.
You are given the following data about a virtual memory system:(a)The TLB can hold 1024 entries and can be accessed in 1 clock cycle (1 nsec).(b) A page table entry can be found in 100 clock cycles or 100 nsec.(c) The average page replacement time is 6 msec.If page references are handled by the TLB 99% of the time, and only 0.01% lead to a page fault, what is the effective address-translation time?
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 14 uses about how long does it take to compact 4 GB. For simplicity assume that word O is part of a hole and that the highest word in memory contains valid data
Calculate the effective access time for a demand-paged memory given a memory access time of 100 nanoseconds, a page fault service time of 6,000,000 nanoseconds, and a page-fault rate of 1 page fault out of every 10,000 access attempts. You must show your calculations to receive full credit on this question.
The access time of the cache memory is 100ns and that of main memory 1000ns.It is estimated that S0percent of the memory requests are for read and the remaining 20 percent for write. The hit ratio for read accesses only is 0.9. A write through procedure is used. What is the average access time of the system considering only memory read cycles? What is the average access time of the system for both read cycles and write requests? What is the hit ratio taking into consideration the write cycles?
QUESTION 3 The effective access time for a machine with a page fault probability of 3%, memory access time (tą) of 200 nanoseconds, and a page fault (tf) time of 50 milliseconds is a. 1500194 b. 1000196 O C. None of the listed d. 250000
Q1. Consider that the up system consists of two memory sections, the SRAM and the EPROM. The up clock system is 5 MHz and the bus cycle is equal to 4-clocks of the system clock pulses. For reading process, suppose that the waiting time of SRAM equals % waiting time of EPROM. If you know that, the total time requires for reading both memory types 1900 ns, what is the total waiting time requires for reading 128 bytes from the SRAM and the total waiting time requires for reading 512 bytes of EPROM? How many wait states require for reading each section of memory? Sketch the required circuit for generating the required number of the wait states.
You are given the following data about a virtual memory system:(a) The TLB can hold 512 entries and can be accessed in 1 clock cycle (1nsec).(b) A page table entry can be found in 100 clock cycles or 100 nsec.(c) The average page replacement time is 9 msec.If page references are handled by the TLB 99% of the time, and only 0.01%lead to a page fault, what is the effective address-translation 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?