A cache is set up with a block size of 32 words. There are 16 blocks in cache and set up to be direct map.  You have byte address 0x8923. Show the word address, block address, tag, and index.   Show each access being filled in with a note of hit or miss. You are given word address and the access are: 0xff, 0x08, 0x22, 0x0

If SS = 3500H and the SP is FFFEH,(a) Calculate the physical address of the current top of the stack,(b) Calculate the lower range.(c) Calculate the upper range of the stack segment.(d) Show the logical address of the stack.(e) What is the range of physical addresses if CS = FF59 ?

Make the difference between a cache that is directly mapped and one that is totally associative.

Suppose a malloc implementation returns 8-byte aligned addresses and uses an explicit free list where the next and previous pointers are each 32-bits. Blocks have a 32-bit header and 32-bit footer, where the low-order bit of the header and footer are used to indicate whether the block is allocated (1) or free (0). Furthermore, the block size (which includes the header, payload, footer, and any necessary padding) is rounded up to the nearest multiple of 8, and this size (in bytes) is stored in the header and footer. Assume any padding must be between the payload and the footer.If we call malloc(1), what block size will be allocated, in bytes? With the same conditions as #1, and assuming we've already called malloc(1), if the heap used by malloc starts at address 0x4000 (16384 in decimal), what address would be returned if we then called malloc(32)?

What registers does _GetDate use?

In mapping, the data can be mapped only in one line in the Cache Memory. Select one: a. Associative O b. Indirect O C. Direct O d. Set Associative

Computer Science You are given a cache that has 16 byte blocks, 512 sets, and is 2-way set associative. Integers are 4 bytes. Give the C code for a loop that has a 100% miss rate in this cache but whose hit rate rises to almost 100% if you double the size of the cache. Do not assume the starting indexes of any arraysarrays.

In assembly 68k write the: Initialize the supervisor stack pointer to $8000 Initialize the program counter to $1000 Reserve locations at $2000 to hold your first name only (Joshua) as text and call it NAM Reserve locations at $3000 to store 9 longwords, call it MEM, and write your family name (Kimmich) as a comment Reserve locations at $12400 to store 32-bit unsigned integer variable called RES (to be computed)

cache.xls (or it can be a google sheet that you share with me in a cache.txt with the url in it )= a spreadsheet showing the cycle counts of a cached and non-cached machine. Also, you need to show the cache as the memory accesses progress in your program marking the hits and misses (misses in RED). You should have cells to show how many hits and how many misses your program has, and details on what is the cache replacement policy you implemented.   Here is code:   void c_cache_for_badge() {    int na = 8, nb = -3, nc = 10;    // pointers    int *npa;      npa = (int*)malloc(sizeof(int)*84);      // init integer pointers    for(int i = 0; i < 84; i++)    {        npa[i] = i;    }        // integer pointers    for(int i = 9; i < 70; i= i + 3)    {        nb += npa[i % 5] + npa[i % 3] + npa[i % 6];    }     }   void main() {    c_cache_for_badge(); }

me remaining: 00:09:34 Computer Science Create a MPI version of the program below that uses a striped decomposition. Each process is responsible for some number of columns of the square and also maintains two columns of ghost cells to mirror the columns on the neighboring processes. The ghost cells are needed in order to update the cells along the process boundary. At each time step, a ghost cell exchange takes place, then the update takes place.   #include <stdlib.h> #include <assert.h> #include "anim.h"   const int n = 200; // number of discrete points including endpoints int nstep = 200000; // number of time steps int wstep = 400; // time between writes to file const double m = 100.0; // initial temperature of rod interior const int h0 = n/2 - 2, h1 = n/2 + 2; // endpoints of heat source const double k = 0.2; // diffusivity constant char * filename = "diff2d.anim"; // name of file to create double ** u, ** u_new; // two copies of the temperature function ANIM_File…