Suppose we have a 16-bit main memory address and 32 blocks of cache memory accessible on a byte-addressable computer using 2-way set associative mapping. Display your results after calculating the offset field size based on the fact that each block contains 8 bytes.

The Kiwi™ memory architecture design team has a dilemma.  The team is considering several different memory configuration variations for an upcoming machine design.  Consider the following designs (All memory accesses are in terms of bytes, and all are using paging techniques):   Characteristic Design 1 Design 2 Design 3 Physical Memory Address Width 8 bit 16 bit 32 bit Logical Address Width 12 bit 20 bit 24 bit Page/Frame size in bytes 16 bytes 32 bytes 64 bytes Page Table Type Single Single Double a) For each design, list the maximum number of pages each process can access in logical address space. b) For each design, list the maximum number of frames in physical memory.

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?

Consider an array (arr)  and the registers R1,R2,R3. Give the statement that can find the next address of the  arr.  (R2 is for the index of the array, R3 will have this address)