Bounds modelling and compiler optimizations for superscalar performance tuning

被引:4
|
作者
Bose, P
Kim, S
O'Connell, FP
Ciarfella, WA
机构
[1] IBM Corp, TJ Watson Res Ctr, Yorktown Heights, NY 10598 USA
[2] IBM Corp, High End Proc Dev, Austin, TX USA
关键词
loop performance; super scalar processors; bounds analysis; compiler optimization; performance tuning;
D O I
10.1016/S1383-7621(98)00053-8
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the floating point microarchitecture support in RISC superscalar processors. We briefly review the fundamental performance trade-offs in the design of such microarchitecutres. We propose a simple, yet effective bounds model to deduce the "best-case" loop performance limits for these processors. We compare these bounds to simulated and real performance measurements. From this study, we identify several loop tuning opportunities. In particular. we illustrate the use of this analysis in suggesting loop unrolling and scheduling heuristics. We report our experimental results in the context of a set of application-based loop test cases. These an designed to stress various resource limits in the core (infinite cache) microarchitecture, (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:1111 / 1137
页数:27
相关论文
共 50 条
  • [41] A compiler framework for speculative analysis and optimizations
    Lin, J
    Chen, T
    Hsu, WC
    Ju, RDC
    Ngai, TF
    Yew, PC
    Chan, S
    ACM SIGPLAN NOTICES, 2003, 38 (05) : 289 - 299
  • [42] GLOBAL OPTIMIZATIONS IN A PROLOG COMPILER FOR THE TOAM
    ZHOU, NF
    JOURNAL OF LOGIC PROGRAMMING, 1993, 15 (04): : 275 - 294
  • [43] A Framework for Formal Verification of Compiler Optimizations
    Mansky, William
    Gunter, Elsa
    INTERACTIVE THEOREM PROVING, PROCEEDINGS, 2010, 6172 : 371 - 386
  • [44] A Study of Conflicting Pairs of Compiler Optimizations
    Ben Asher, Yosi
    Haber, Gadi
    Stein, Esti
    2017 IEEE 11TH INTERNATIONAL SYMPOSIUM ON EMBEDDED MULTICORE/MANY-CORE SYSTEMS-ON-CHIP (MCSOC 2017), 2017, : 52 - 58
  • [45] Generating Compiler Optimizations from Proofs
    Tate, Ross
    Stepp, Michael
    Lerner, Sorin
    POPL'10: PROCEEDINGS OF THE 37TH ANNUAL ACM SIGPLAN-SIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES, 2010, : 389 - 402
  • [46] Fast selection of compiler optimizations using performance prediction with graph neural networks
    do Rosario, Vanderson Martins
    da Silva, Anderson Faustino
    Zanella, Andre Felipe
    Napoli, Otavio O.
    Borin, Edson
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2023, 35 (17):
  • [47] Evaluating the Effects of Compiler Optimizations on Mutation Testing at the Compiler IR Level
    Harir, Farah
    Shi, August
    Converse, Hayes
    Khurshid, Sarfraz
    Marinov, Darko
    2016 IEEE 27TH INTERNATIONAL SYMPOSIUM ON SOFTWARE RELIABILITY ENGINEERING (ISSRE), 2016, : 105 - 115
  • [48] Simplification of array access patterns for compiler optimizations
    Paek, Y
    Hoeflinger, J
    Padua, D
    ACM SIGPLAN NOTICES, 1998, 33 (05) : 60 - 71
  • [49] Locality-Based Optimizations in the Chapel Compiler
    Kayraklioglu, Engin
    Ronaghan, Elliot
    Ferguson, Michael P.
    Chamberlain, Bradford L.
    LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING (LCPC 2021), 2022, 13181 : 3 - 17
  • [50] Automatic Selection of Compiler Optimizations by Machine Learning
    Peker, Melih
    Ozturk, Ozcan
    Yildirim, Suleyman
    Ozturk, Mahiye Uluyagmur
    2023 31ST SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE, SIU, 2023,