
- 1 R. A. Towle, Control and Data Dependence }or Program Transformations. PhD thesis, Department of Computer Science, University of Illinois, Urbana-Champaign, IL, 1976. Google Scholar
Digital Library
- 2 J.R. Allen, K. Kennedy, C. Porterfield, and J. Warren, "Conversion of control dependence to data dependence," in Proceedings of the l Oth A CM Symposium on Principles of Programming Languages, pp. 177-189, January 1983. Google Scholar
Digital Library
- 3 J. C. H. Park and M. S. Schlansker, "On predicated execution,'' Tech. Rep. HPL-91-58, HP Laboratories, Palo Alto, CA, May 1991.Google Scholar
- 4 B. R. Rau and C. D. Glaeser, "Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing," in Proceedings of the 20th Annual Workshop on Microprogramming and Microarchitecture, pp. 183-198, October 1981. Google Scholar
Digital Library
- 5 M. S. Lean, "Software pipellning: An effective scheduling technique for VLIW machines," in Proceedings of the A CM SIGPLAN 1988 Conference on Programming Language Design and Implementation, pp. 318-328, June 1988. Google Scholar
Digital Library
- 6 A. Aiken and A. Nicolau, "Optimal loop parallelization," in Proceedings of the ACM SiGPLAN 1988 Conference on Pro. gramming Language Design and Implementation, pp. 308- 317, June 1988. Google Scholar
Digital Library
- 7 B. R. Rau, D. W. L. Yen, W. Yen, and R. A. Towle, "The Cydra 5 departmental supercomputer," IEEE Computer, pp. 12-35, January 1989. Google Scholar
Digital Library
- 8 J. C. Dehnert, P. Y. T. Hsu, and J. P. Bratt, "Overlapped loop support in the Cydra 5," in Proceedings of the 17th International Symposium on Computer Architecture, pp. 26- 38, May 1989. Google Scholar
Digital Library
- 9 P. Y. T. Hsu and E. S. Davidson, "Highly concurrent scalar processing," in Proceedings of the 13th International Symposium on Computer Architecture, pp. 386-395, June 1986. Google Scholar
Digital Library
- 10 P. P. Chang, S. A. Mahlke, W. Y. Chen, N. J. Warter, and W. W. Hwu, "IMPACT: An architectural framework for multiple-instruction-issue processors," in Proceedings of the 18th International Symposium on Computer Architecture, pp. 266-275, May 1991. Google Scholar
Digital Library
- 11 W. W. Hwu, S. A. Mahlke, W. Y. Chen, P. P. Chang, N. J. Water, R. A. Bringmann, R. G. Ouellette, R. E. Hank, T. Kiyohara, G. E. Haab, J. G. Holm, and D. M. Lavery, "The superblock: An effective structure for VLiW and superscalar compilation," To appear Journal of Supercomput. ing, january 1993. Google Scholar
Digital Library
- 12 J. Ferrante, K. J. Ottenstein, and J. D. Warren, "The program dependence graph and its use in optimization," A CM Transactions on Programming Languages and Systems, vol. 9, pp. 319-349, July 1987. Google Scholar
Digital Library
- 13 P. Tirumalai, M. Lee, and M. Schlansker, "Parallellzation of loops with exits on pipelined architectures," in Proceedings of Supercomputing '90, November 1990. Google Scholar
Digital Library
- 14 S.A. Mahlke, W. Y. Chen, W. W. Hwu, B. R. Rau, and M. S. Schlansker, "Sentinel scheduling for VLIW and superscalar processors," in Proceedings of 5th International Conference on Architectural Support for Programming Languages and Operating Systems, October 1992. Google Scholar
Digital Library
- 15 E. Morel and C. Renviose, "Global optimization by suppression of partial redundancies," Communications of the A CM, pp. 96-103, February 1979. Google Scholar
Digital Library
Index Terms
Effective compiler support for predicated execution using the hyperblock
Recommendations
The effects of predicated execution on branch prediction
MICRO 27: Proceedings of the 27th annual international symposium on MicroarchitectureHigh performance architectures have always had to deal with the performance limiting impact of branch operations. Microprocessor designs are going to have to deal with this problem as well, as they move towards deeper pipelines and support for multiple ...
Using Predicated Execution to Improve the Performance of a Dynamically Scheduled Machine with Speculative Execution
Conditional branches incur a severe performance penalty in wide-issue, deeply pipelined processors. Speculative execution(1, 2) and predicated execution(3---9) are two mechanisms that have been proposed for reducing this penalty. Speculative execution ...






Comments