List steps to illustrate the procedure of the addition of tw

List steps to illustrate the procedure of the addition of two floating-point numbers Which of the following statements are generally true? Memory hierarchies take advantage of temporal locality. On a read, the value returned depends on which blocks are in the cache. Most of the cost of the memory hierarchy is at the highest level. Most of the capacity of the memory hierarchy is at the lowest level. For the problems in this exercise, assume that there are no pipeline stalls and that the breakdown of executed instructions is as follows: In what fraction of all cycles is the data memory used? In what fraction of all cycles is the input of the sign-extend circuit needed? What is this circuit doing in cycles in which its input is not needed?

Solution

1.Let X and Y are variables. First, alter the two representations to scientific notation. Therefore, we explicitly represent the hidden 1.

In sequence to add, we require the exponents of the two numbers to be the similar. We do this with rewriting Y. This will effect in Y being not normalized, however value is equal to the normalized Y.

Add x - y to Y\'s exponent. Move the radix point of the mantissa Y left by x - y to compensate for alters in exponent.

Add the two mantissas of X and the altered Y\' together.

If the sum in the preceding step does not have a solitary bit of value 1, left of the radix point, and after that adjust the radix point and exponent until it do.

change back to the single byte floating point illustration.

2.

(1) Memory hierarchies take advantage of temporal locality.