|
 |
|
|
|
|
A. S. Tanenbaum. Implications of structured programming for machine architecture. Communications of the ACM, 21(3):237246, 1978. |
|
|
|
|
|
|
|
|
Design Target Data and Tools Used in This Chapter |
|
|
|
 |
|
|
|
|
J. C. Huck. Comparative Analysis of Computer Architectures. PhD thesis, Stanford University, May 1983. |
|
|
|
 |
|
|
|
|
J. C. Huck and M. J. Flynn. Analyzing Computer Architectures. IEEE Computer Society Press, 1989. |
|
|
|
 |
|
|
|
|
C. L. Mitchell and M. J. Flynn. A workbench for computer architects. IEEE Design & Test, 5(1):1929, February 1988. |
|
|
|
 |
|
|
|
|
C. Z. Loboz. An Analysis of Program Execution: Issues for Computer Architecture. PhD thesis, The Australian National University, July 1990. |
|
|
|
 |
|
|
|
|
T. E. Anderson, H. M. Levy, B. N. Bershad, and E. D. Lazowska. The interaction of architecture and operating system design. ASPLOS-IV Proceedings, pages 108120, Santa Clara, CA, April 1991. |
|
|
|
 |
|
|
|
|
A. V. Aho and J. D. Ullman. Principles of Compiler Design. Addison-Wesley, Reading, MA, 1977. |
|
|
|
 |
|
|
|
|
C. Z. Loboz. An Analysis of Program Execution: Issues for Computer Architecture. PhD thesis, The Australian National University, July 1990. |
|
|
|
|
|
|
|
|
1. Based on the data in Tables 3.2 and 3.3, compute the expected instruction bandwidth for R/M and R+M architectures relative to L/S. The instruction bandwidth is the number of instruction bits required to execute a program (e.g., suppose a program consists of 100 HLL operations). |
|
|
|
|
|
|
|
|
2. For an R/M machine, suppose all instructions but the LDM and STM execute in unit time. If the LDM and STM require a number of time units equal to the number of registers moved less one (i.e., the excess over a simple LD or ST), compute the effect of LDM and STM on performance. Use mean LDM/STM data from section 3.3.1 and Table 3.15. |
|
|
|
|
|
|
|
|
3. What percentage of branch instructions have generally predictable outcomes (greater than 90%)? For both scientific and commercial environments, make a table of branch instruction types. Specify the probable outcome and whether the outcome is predictable to greater than 90%. |
|
|
|
|
|