Except for branching and procedure calls, instructions are needed according to a uniformly ascending sequence of addresses. Data may be accessed in many ways: pseudorandomly, in ascending address sequence, in descending sequence, etc.
A2:
The linker can organize the data segment(s) to be reachable with the fewest independent pointers, can copy either user-supplied or library routines inline, and can detect other opportunities for optimization across the entire application. Usually compilers treat each source file as an independent entity.
A3:
Consider the way the compares and predicate values will work.
A4:
80.
A9:
We showed one way with our exploration of the com_f.f program in the chapter.
A10:
Expand upon the following: changing from a tight loop to linear code; replacing the call with actual code; and scheduling means to reorder to minimize data stalls.
A11:
Some compilers may warn about uninitialized variables or about computed quantities that are never subsequently used.
