Need correct answer only upvote otherwise downvotes more and more 4 Consider that a level of the memory hierarchryhas a hit rate of sO Memory requests take10 ns to complcte if they hit in the level, andmemary requesta that mis in the level take100 ns to complete. The average access time

Name: Need correct answer only upvote otherwise downvotes more and more 4 Co
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Need correct answer only upvote otherwise downvotes more and more 4 Consider that a level of the memory hierarchryhas a hit rate of sO Memory requests take10 ns to complcte if they hit in the level, andmemary requesta that mis in the level take100 ns

The answer for average access time of the level is

Answered: Comsider that a level of the memory…

Engineering

Computer Science

Comsider that a level of the memory bierarchy las hit rate of s0 Memory requests take 10 s to complete if dey ht i the level and the leved take o 100 s acces tme complete The arage

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 12P

See similar textbooks

Similar questions

please no chatgpt answer . Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 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 80 percent of the accesses are in the associative memory and that, of those remaining, 10 percent (or 2 percent of the total) cause page faults. What is the effective memory access time? Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Assuming demand paging with four frames, Show which pages are resident under the LRU, FIFO, and Optimal replacement algorithms by filling out the following tables. How many page faults would occur…
Suppose that a computer has a processor with two L1 caches, one for instructions and one for data, and an L2 cache. Let τ be the access time for the two L1 caches. Themiss penalties are approximately 15τ for transferring a block from L2 to L1, and 100τ fortransferring a block from the main memory to L2. For the purpose of this problem, assumethat the hit rates are the same for instructions and data and that the hit rates in the L1 andL2 caches are 0.96 and 0.80, respectively.(a) What fraction of accesses miss in both the L1 and L2 caches, thus requiring accessto the main memory?(b) What is the average access time as seen by the processor?(c) Consider the following change to the memory hierarchy. The L2 cache is removedand the size of the L1 caches is increased so that their miss rate is cut in half. Whatis the average memory access time as seen by the processor in this case
Let's pretend for a moment that we have a byte-addressable computer with fully associative mapping, 16-bit main memory addresses, and 32 blocks of cache memory. The following holds true if each block is 16 bits in size:a) Determine how many bytes the offset field is.Measure the tag field's width and height in pixels (b).
Consider a memory system with a cache access time of 100ns and a memory access timeof 1200ns. If the effective access time is 10% greater than the cache access time, what is thehit ratio H?
Consider a demand-paged computer system where the degree of multiprogramming is currently fixed at seven. The system was recently measured to determine utilization of the CPU and the paging disk. Three alternative results are shown below. For each case, what is happening? Can the degree of multiprogramming be increased to increase the CPU utilization? Is the paging helping? Justify.a. CPU utilization 10 percent; disk utilization 95 percentb. CPU utilization 95 percent; disk utilization 1 percentc. CPU utilization 10 percent; disk utilization 5 percen
6.plHeap memory management Show the memoryallocation of process requests of size 90KB, 39KB, 27KB, 16KB and 36KB which will bereceived in order using:a) Best-Fit memory allocation methodb) Worst-Fit memory allocation method.
Let's pretend for a moment that we have a byte-addressable computer with 16-bit main memory addresses and 32-bit cache memory blocks, and that it employs two-way set associative mapping. Knowing that each block has eight bytes, please calculate the size of the offset field and provide evidence of your calculations.
In this problem, you will explore processor frequency in the context of the speed of light.Suppose you have overclocked a processor to 8,722.78MHz. This processor can execute one instruction per cycle. Further let us suppose that the system is accessing a magnetic disk (HD) with an access time of 11ms. 1. Suppose that you are designing the machine architecture and want to guarantee the CPU can obtain data from memory within 4 CPU cycles. Given that the address has to travel from the CPU to the memory unit (MMU) and that the data has to travel from memory to the CPU, what is the maximum distance between CPU and the MMU if the signal on the memory bus propagates at 75% of the speed of light?
Given memory partitions of 100K, 600K, 400K, 500K, and 300K (inorder), howwould each of the First-fit, Best-fit, and Worst-fitalgorithms place processes of 117K, 412K, 325K, and 510K (inorder)?
a. We are given a system with 2 levels of cache, L1 and L2. The CPU directly interfaces to the L1 cache, which has a hit time of 1 ns and a hit rate of 0.4. On misses, the L1 accesses the L2 cache, which has an access time of 20 ns, and a hit rate of 0.8. If the L2 misses, it accesses the main memory, which has an access time of 100 ns. Determine the average memory access time, of the CPU to the memory hierarchy.b. A cache is inserted between the main memory, which is 32 MB, and the CPU. This cache can accomodate 64 blocks and each block can accomodate 128 words (2B per word). How many possible blocks can be stored in one cache block if it is a direct-mapped cache?
Q3 If a microprocessor has L1 and L2 caches. The access time for L1 cache is τ. The miss penalties for transferring a block of memory from L2 to L1 is 10τ and it takes 120τ for transferring a block from memory to L2. The hit rates are the same for instructions and data and that the hit rates in the L1 and L2 caches are 0.90 and 0.85, repectively. I. Determine the fraction of accesses miss in both the L1 and L2 caches, thus requiring access to the main memory? II. What is the average access time as seen by the processor? Q4 Determine the number of bytes included in the address ranging from 123000H to 0C37000H, you must present the answers using units of Mbytes, Kbytes and bytes. Q5 If the size of a program is 424892 Bytes and its starting address is 000000H, determine the ending address of the program.
Q2) Given a physical memory of 8 k and a cache memory of 512 bytes with block size 64 bytes. The system uses associative mapping with set size 2 lines per setA- How the memory address will be split to indicate tag, and offset B- What is the size of tag directory.