Assume you have: 32-bit addresses, 4KB Page size, 4MB Physical
Memory Space, 4KB Cache with 4-way set associative and LRU
replacement, 32 Byte Cache block size, 4-entry fully associative
TLB. A program to be run on this machine begins as follows:
double A[1024];
int i, j;
double sum = 0;
for( i = 0; i < 1024; i++
) // first loop
A[i] = i;
for( j = 0; j < 1024; j += 16 ) // second loop
sum += A[j];
The size of double is 8 bytes. Array A is located in memory starting at 0x1000 and stored in row major order. The cache and TLB are initially empty and NO pre-fetching is done. The only data memory references made by the program are those to array A.
If you have any questions comment down.. Please don't just simply downvote and leave. Also please upvote thanks
Assume you have: 32-bit addresses, 4KB Page size, 4MB Physical Memory Space, 4KB Cache with 4-way...
Assume a memory model where you have a cache size of 4 blocks, a block size of 8, and addresses from 0 through 511. Assume that the n-way associative cache and fully associative cache use a LRU (least recently used) eviction strategy. Consider the following sequence of memory accesses: 17, 66, 22, 66, 80, 41, 85, 66, 17, 104. (a) Show the updates to a 2-way associative cache in a table using a similar format to the table shown on...
18. You have a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of 8 bytes and page size of 16 bytes. In the system below, main memory is divided into blocks, where each block is represented by a letter. Two blocks equal one frame. Given the system state as depicted above, answer the following questions: a) How many bits are in a virtual address...
Exercise l: Suppose that we have a virtual memory space of 28 bytes for a given process and physical memory of 4 page frames. There is no cache. Suppose that pages are 32 bytes in length. 1) How many bits the virtual address contain? How many bits the physical address contain? bs Suppose now that some pages from the process have been brought into main memory as shown in the following figure: Virtual memory Physical memory Page table Frame #...
4. Assume it take 50 nanoseconds to resolve a memory reference when accessing the physical memory address directly. a) We designed a system using virtual addresses with page tables without a TLB. In other words, when fetching data from memory, the page table is accessed to get the PTE for translating an address, a translation is completed, and finally, a memory reference to the desired data is resolved. In this system, what is the effective memory reference time. Assume the...
) Consider an 8-way associative 64 Kilo Byte cache with 32 byte cache lines. Assume memory addresses are 32 bits long. a). Show how a 32-bit address is used to access the cache (show how many bits for Tag, Index and Byte offset). b). Calculate the total number of bits needed for this cache including tag bits, valid bits and data c). Translate the following addresses (in hex) to cache set number, byte number and tag (i) B2FE3053hex (ii) FFFFA04Ehex...
Given a virtual memory configuration with: • 4 TB virtual memory space • 32 GB physical memory space • 16 KB page size How many bits are needed for the virtual address? Choose... How many bits are needed for the physical address? Choose... How many bits in the address correspond to page offset bits? Choose... - How many bits will the virtual page number (VPN) be? Choose... - How many bits will the physical page number (PPN) be? Choose... →...
4. Assume that we have a machine with the following memory specifications: Virtual addresses are 32 bits wide Physical addresses are 26 bits wide . Page size is 16 Kbytes 4/A) How many pages are in the virtual memory space? 4/B) How many page frames are in the physical memory space? 4/C) If each page table entry consists of a physical frame number, 1 present/absent bit Answers Pages .Page Frames and 1 dirty/clean bit (which shows if the page has...
A 2-way set associative cache consists of four sets 0, 1, 2, 3. The main memory is word addressable (i.e. treat the memory as an array of words indexed by the address). It contains 2048 blocks 0 through 2047, and each block has eight words. (a) How many bits are needed to address the main memory? (b) Show how a main memory address will be translated into a tag, a set number, and an offset within a block. Illustrate this...
The RISC-V 32-bit architecture supports virtual memory with 32-bit virtual addresses mapping to 32-bit physical addresses. The page size is 4Kbytes, and page table entries (PTEs) are 4 bytes each. Translation is performed using a 2-level page table structure. Bits 31:22 of a virtual address index the first-level page table. If the selected first-level PTE is valid, it points to a second-level page table. Bits 21:12 of the virtual address then index that second-level page table. If the selected second-level...
A short program loop goes through a 16 kB array one word at a time, reads a number from the array, adds a random number, and stores the result in the corresponding entry in another array that is located in the memory immediately following the first array. An outer loop repeats the above operation 100 times. The 64-bit processor, operating at a clock frequency of 4 GHz, is pipelined, has 48 address lines, three levels of caches with a 64...