What is virtual memory?

Match the piece of the floating point binary number to the correct term: -1.10110101 x 26

Assume the miss rate of an instruction cache is 3% and the miss rate of the data cache is 5%. If a processor has a CPI of 2 without any memory stalls, and the miss penalty is 120 cycles for all misses, determine how much faster a processor would run with a perfect cache that never missed. Assume the frequency of all loads and stores is 35%. Include one digit after the decimal place. What is the CPI for memory stalls? [cpi_memory] What is the total CPI? [cpi_total] What would be the speed-up if a perfect cache could be implemented (i.e. no stalls)? [speedup]

What is the tag for memory address 0xBA782B57 if there are 23 bits in the tag?

The following instruction set will be compared using a pipeline and non-pipeline execution.   InstructionFetch REG ALU DataAccess Reg 25 ps 10 ps 20 ps 15 ps 10 ps How long would 100 instruction sets take for a 5-stage non-pipeline compared to a pipeline version?  Nonpipeline Speed: [non] Pipeline Speed:  [pipeline]    

The following are defined labels.  Create a branching structure (switch/case) that given register $t0, will go to the label one if the value is 1, and two if the value is 2, three if the value is 3, otherwise, it will branch to default. default: #Code for default j endone: #Code for one j endtwo: #Code for two j endthree: #Code for Three j end

Write the following binary number as an IEEE 754 single precision floating point number.   1010100.01011101012 Enter answer in binary and include all bits. You can separate every 4 or 8 bits with a space to help keep track of the bits.

  Calculate the speedup of the following pipeline vs nonpipeline times. Nonpipeline Time: 60000 Pipeline Time: 18300   *Round to 1 decimal place

Which best describes “seek time” for a disk drive?

Determine the order of each step and the location that would appear in the image below for the following R-Type instruction sub $t0, $t1, $t2 Determine the order of an add statement. Step 1: [step1] [location1] Step 2: [step2][location2] Step 3: [step3][location3] Step 4: [step4][location4]