• DocumentCode
    1068113
  • Title

    Vector register allocation

  • Author

    Allen, Randy ; Kennedy, Ken

  • Author_Institution
    Dept. of Comput. Sci., Rice Univ., Houston, TX, USA
  • Volume
    41
  • Issue
    10
  • fYear
    1992
  • fDate
    10/1/1992 12:00:00 AM
  • Firstpage
    1290
  • Lastpage
    1317
  • Abstract
    The problem of allocating vector registers on supercomputers is addressed in the context of compiling vector languages. Two subproblems must be solved to achieve good vector register allocation. First, the vector operations in the source program must be subdivided into sections that fit the hardware of the target machine. Second, the locality of reference of the vector operations must be improved via aggressive program transformations. Solutions to both of these problems, based on the use of novel aspects of data dependence, are presented. The techniques described extend naturally to scalar machines by observing that a scalar register is simply a vector register of length one
  • Keywords
    parallel processing; program compilers; aggressive program transformations; compiling vector languages; data dependence; supercomputers; vector register allocation; Computer aided instruction; Computer science; Costs; Hardware; High performance computing; Memory architecture; Optimizing compilers; Registers; Runtime; Supercomputers;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.166606
  • Filename
    166606