Instruction Window Size Trade-Offs and Characterization of Program Parallelism

IEEE Transactions on Computers

Volumn 43, Issue 4, 1994, Pages 431-442

  Dubey, Pradeep K ^a   Adams, George B ^b   Flynn, Michael J ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b PURDUE UNIVERSITY   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

concurrency detection; cost of parallelism; formance model; in ; misprediction delay; parallelism analysis; per ; speculative execution; struction window; superscalar

Indexed keywords

C (PROGRAMMING LANGUAGE); FORTRAN (PROGRAMMING LANGUAGE); PERFORMANCE; PIPELINE PROCESSING SYSTEMS; PROBABILITY;

CONCURRENCY DETECTION; INSTRUCTION WINDOWS; MISPREDICTION DELAYS; SUPERSCALARS;

PARALLEL PROCESSING SYSTEMS;

EID: 0028416719     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.278481     Document Type: Article

References (28)

1. R. D. Acosta, J. Kjelstrup and H. C. Torng, “An instruction issuing approach to enhancing performance in multiple functional unit processors,” IEEE Trans. Comput., vol. C-35, pp. 815-828, Sept. 1986.
2. D. Bailey, J. Barton, T. Lasinski, and H. Simon, “The NAS parallel benchmarks,” Rep. RNR-91-002, NASA Ames Res. Ctr., Jan. 1991.
3. M. Butler, T. Yeh, Y. Patt, M. Alsup, H. Scales, and M. Shebanow, “Single instruction stream parallelism is greater than two,” in Proc. 18th Annu. Symp. Comput. Architecture, May 1991, pp. 276-286.
4. R. Cohn, T. Gross, M. Lam, and P. S. Tseng, “Architecture and compiler trade-offs for a long instruction word microprocessor,” in Proc. of ASPLOS III, Apr. 1989, pp. 2-14.
5. R. P. Colwell, W. E. Hall, C. S. Joshi, D. B. Papworth, P. K. Rodman, and J. E. Tomes, “Architecture and implementation of a VLIW supercomputer,” Proc. of Supercomputing ' x2018;90, Nov. 1990, pp. 910-919.
6. G. Cybenko, L. Kipp, L. Pointer, and D. Kuck, “Supercomputer performance evaluation and the PERFECT benchmarks,” CSRD Rep. No. 965, Univ. of Illinois, Urbana, IL, Mar. 1990.
7. R. P. Colwell, R. P. Nix, J. J. O’Donnell, D. B. Papworth, and P. K. Rodman, “A VLIW architecture for a trace scheduling compiler,” IEEE Trans. Comput. vol. 37, pp. 967-979, Aug. 1988.
8. P. K. Dubey and M. J. Flynn, “Branch strategies: Modelling and optimization,” IEEE Trans. Comput., vol. 40, pp. 1159-1167, Oct. 1991.
9. P. K. Dubey, G. B. Adams, III, and M. J. Flynn, “Exploiting fine-grain concurrency: analytical insights in superscalar processor design,” Tech. Rep. No. TR-EE 91-31, School of Elect. Eng., Purdue Univ., Aug. 1991.
10. J. A. Fisher, “Trace scheduling: A technique for global microcode compaction,” IEEE Trans. Comput., vol. C-30, pp. 478-490, July 1981.
11. P. Y. T. Hsu and E. S. Davidson, “Highly concurrent scalar processing,” Proc. 13th Annu. Symp. on Comput. Architecture, June 1986, pp. 386-395.
12. R. A. Kamin, G. B. Adams, III, and P. K. Dubey, “Dynamic trace analysis for analytic modeling of superscalar performance,” to appear in a Special Issue of Performance Evaluation (the Performance Modeling of Parallel Processing Systems).
13. D. Kuck, Y. Muraoka, and S. Chen, “On the number of operations simultaneously executable in Fortran-like programs and their resulting speedup,” IEEE Trans. Comput., vol. C-21, pp. 1293-1310, Dec. 1972.
14. H. T. Kung, “Why systolic architectures?,” Computer, vol. 15, no. 1, pp. 37-46, Jan. 1982.
15. M. Lam, “Software pipelining: An effective scheduling technique for VLIW machines,” in Proc. SIGPLAN ’88 Conf. Prog. Lang. Design and Implementation, June 1988, pp. 318-328.
16. T. Nakatani and K. Ebcioglu, “Using a lookahead window in a compaction based parallelizing compiler,” Proc. 23rd Annu. Workshop Microprogramming, Nov. 1990, pp. 57-68.
17. A. Nicolau and J. Fisher, “Measuring the parallelism available for very long instruction word architectures,” IEEE Trans. Comput., vol. C-33, pp. 968-976, Nov. 1984.
18. A. Nicolau, “Uniform parallelism exploitation in ordinary programs,” in Proc. Int. Conf. Parallel Processing, Aug. 1985, pp. 614—618.
19. R. R. Oehler and R. D. Groves, “IBM RISC System/6000 processor architecture,” IBM J. Res. Develop., pp. 23-36, Jan. 1990.
20. Y. N. Patt, W.-M. Hwu, and M. Shebanow, “HPS, a new microar-chitecture: Rationale and introduction,” in Proc. 18th Annu. Workshop Microprogramming, pp. 103-108, Dec. 1985.
21. E. M. Riseman and C. C. Foster, “The inhibition of potential parallelism,” IEEE Trans. Comput., vol. C-21, pp. 1405-1411, Dec. 1972.
22. M. Schuette, “Exploitation of instruction-level parallelism for detection of processor execution errors,” Res. Rep. No. CMUCDS-91-7, Carnegie-Mellon Univ., 1991.
23. M. D. Smith, M. Johnson and M. A. Horowitz, “Limits multiple instruction issue,” in Proc. of ASPLOS III, Apr. 1989, pp. 290-302.
24. G. S. Sohi and S. Vajapeyam, “Instruction issue logic in highperformance interruptible pipelined processors,” in Proc. 14th Annu. Symp. on Computer Architecture, June 1987, pp. 27-34.
25. G. S. Tjaden and M. J. Flynn, “Detection and parallel execution of independent instructions,” IEEE Trans. Comput., vol. C-19, pp. 889-895, Oct. 1970.
26. D. W. Wall, “Limits of instruction-level parallelism,” in Proc. 4th Int. Conf. Architectural Support for Programming Languages and Operating Syst., April 1991, pp. 176-188.
27. R. G. Wedig, “Detection of concurrency in instruction streams,” Ph.D. dissertation, Stanford Univ., June 1982.
28. S. Weiss and J. E. Smith, “Instruction issue logic in pipelined supercomputers,” Proc. 11th Annu. Symp. Comput. Architecture, June 1984, pp. 110-118.