a) Assume, paging has been used as memory management technique and the page table is stored in memory which takes 150 nanoseconds. In addition, the associative memory is also used which takes 50 nanoseconds. What is the effective memory reference time, If 50% of all page-table references are found in the associative memory?

a) Assume, paging has been used as memory management technique and the page table is stored in memory which takes 150 nanoseconds. In addition, the associative memory is also used which takes 50 nanoseconds. What is the effective memory reference time, If 50% of all page-table references are found in the associative memory?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

Question 1 Consider the size of main memory as 32 Bytes and the size of cache memory as 8 Bytes. Implement the Set-Associative mapping technique. Do the following: a) Find the number of bits to address 32 bytes in main memory b) Write the formula to map block of main memory to set of cache memory c) Find the block size, line size, set size, tag size d) Draw the figure to show the distribution of main memory in desired blocks containing bytes e) Draw the figure to show the distribution of cache memory in desired lines containing tag numbers, respective blocks, and byte numbers f) Show the tag allocation for each set (and line) of cache memory
Assume in a Virtual Memory system, a program needs 10 pages with page numbers 0 to 9 and each page is 4 words and the program is allocated 3 page frames: a, b, and c. The word trace for 26 memory accesses by the program are listed below. Use a table to compare the three replacement policies: LRU, OPTimal, and FIFO, by calculating and comparing the hit rate of each policy for these 26 memory accesses.
Consider we have two levels of cache, backed by a main memory (RAM). You are given with the following information about the access time for different level in the memory hierarchy L1 cache costs 1 cycle to access and has a miss rate of 8% L2 cache costs additional 5 cycles to access and has a miss rate of 4% RAM costs additional 40 cycles to access (and has a miss rate of 0%) What is the average memory access time (AMAT)?
Consider a two-level memory system (i.e., cache and main memory). Assume the cache access time is 3 clock cycles, and the hit rate is 95%. What should be the main memory access time (penalty) to ensure the memory access efficiency stays at 0.90?
For a system, RAM = 64KB, Block size = 4 bytes, Cache size = 128 bytes, Direct mapped cache.Calculate the Hit ratio while CPU runs program “Test_Cache”. Also count how many blocks arereplaced in cache memory assuming the cache is empty at the beginning.For the same RAM, block size and Cache memory, what would be the Hit ration in case of FullyAssociative Mapping?For the same RAM, block size and Cache memory, what would be the Hit ration in case of 4-way SetAssociative Mapping?Main Program—“Test_Cache”
Create a memory mapping from the cache memory of 512 MB to the main memory of 4 GB using the four-way set associative approach with a block size of 1 MB. Consider that each memory location may be accessed using a byte address.
CA_10 Let the virtual address be V bits and the virtual addtess space be byte-addressable, the page size be P KB (and P is a power of 2), and the the main memory size be MM MB(where [MM MB]) is divide into [P KB]). (d)How many of the virtual memory bits need to be translated? (e) How many bits will be produced if the virtual-to-pyysical address translation is "successful" (f) How many bits does a physical address have, and how are each of these bits obtained?
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.
(Practice) Although the total number of bytes varies from computer to computer, memory sizes of millions and billions of bytes are common. In computer language, the letter M representsthe number 1,048,576, which is 2 raised to the 20th power, and G represents 1,073,741,824, which is 2 raised to the 30th power. Therefore, a memory size of 4 MB is really 4 times 1,048,576 (4,194,304 bytes), and a memory size of 2 GB is really 2 times 1,073,741,824 (2,147,483,648 bytes). Using this information, calculate the actual number of bytes in the following: a. A memory containing 512 MB b. A memory consisting of 512 MB words, where each word consists of 2 bytes c. A memory consisting of 512 MB words, where each word consists of 4 bytes d. A thumb drive that specifies 2 GB e. A disk that specifies 4 GB f. A disk that specifies 8 GB
NO PLAGARISM Assume that a main memory with only 4 frames each of 16 bytes is initially empty. The CPU generates the following sequence of virtual addresses and uses the Optimal Page replacement policy. 0,4,8,20,24,36,44,12,68,72,80,84,28,32,88,92 Your task is to find out the followings: a. How many page faults does this sequence cause? b. What are the page numbers of the pages which are present in the main memory at the end of the sequence? Assume that it is a byte addressable system.
You are asked to perform capacity planning for a two-level memory system. The first level, M1 is a cache with three capacity choices of 64Kbytes, 128Kbytes, and 256Kbytes. The second level, M2, is a main memory with a 4Mbyte capacity. Let c1 and c2 be the costs per byte and t1 and t2 be the access times for M1 and M2, respectively. Assume c1 = 20 * c2 and t2 = 10 * t1. The cache hit ratios for the 3 capacities are assumed to be 0.7, 0.9 and 0.95, respectively. What is the average memory access time, AMAT, if t1 = 20ns in the three cache designs? (Note that t1 is the time from M1 to CPU and t2 is that from M2 to CPU. This means that t2 includes t1).
A computer has four page frames. The time of loading, time of last access, and the Referenced (R) and Modified (M) bits for each page frame are shown in Table 1 (the times are in clock ticks from the process start at time 0). A page fault to virtual page 4 has occurred at time 265. Table 1: Virtual Page Information Including the initial placement of virtual page in memory (as in Table 1) just before the page fault, consider the following virtual page reference string: 1, 2, 3, 0, 4, 0, 4, 3, 1, 2, 0, 5, 2, 4, 1 Referring to Table 1, which page should be replaced for each of the following memory management policies? Explain why the page is replaced. FIFO LRU Optimal (Refer to the reference string) How many page faults would occur if Optimal policy is used? Show clearly when each page fault would occur.