Computers spend most of their time in loops, so multiple loop itera- tions are great places to speculatively find more work to k
eep CPU resources busy. Nothing is ever easy, though: the compiler emitted only one copy of that loop's code, so even though multiple iterations are handling distinct data, they will appear to use the same registers. To keep multiple iterations' register usages from colliding, we rename their registers. Figure 3.49 shows example code that we would like our hardware to rename. A compiler could have simply unrolled the loop and used different registers to avoid conflicts, but if we expect our hard- ware to unroll the loop, it must also do the register renaming. How? Assume your hardware has a pool of temporary registers (call them T registers, and assume that there are 64 of them, TO through T63) that it can substitute for those registers des- ignated by the compiler. This rename hardware is indexed by the src (source) register designation, and the value in the table is the T register of the last destina- tion that targeted that register. (Think of these table values as producers, and the src registers are the consumers; it doesn't much matter where the producer puts its result as long as its consumers can find it.) Consider the code sequence in Fig ure 3.49. Every time you see a destination register in the code, substitute the next available T, beginning with T9. Then update all the src registers accordingly, so that true data dependences are maintained. Show the resulting code. (Hint: See Figure 3.50.)
From the provided Hint in Figure 3.50 and also The baseline performance ( in cycles, per loop iteration) of the code sequence in Figure 2.35 shows that if no new instruction’s execution could be initiated until the previous instruction’s execution had completed, is 40.
Now, you might ask that how did I come up with that number?
Each instruction requires one clock cycle of execution (a clock cycle in which that instruction, and only that instruction, is occupying the execution units; since every instruction must execute, the loop will take at least that many clock cycles). To that base number, we add the extra latency cycles. Don’t forget the branch shadow cycle.
The best line to be added to the teacher’s lesson plan, which is supposed to emphasize the benefits of global communication, would be (D) learning in a global community enables you to expand your horizons and learn new languages.
The other options are not suitable because they highlight the negative side of global communications, which is not something that the teacher’s lesson intends to do.
Two computers can safely have the same IP address in certain cases. In most cases, if those two computers are on the same local network, it breaks connectivity for one or both of them. Internet protocols work by sending small, individually addressed messages. Each message can be routed differently.
The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.
The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:
If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
