• DocumentCode
    2077074
  • Title

    Interconnect optimisation during data path allocation

  • Author

    Stok, L.

  • Author_Institution
    Dept. of Electr. Eng., Eindhoven Univ. of Technol., Netherlands
  • fYear
    1990
  • fDate
    12-15 Mar 1990
  • Firstpage
    141
  • Lastpage
    145
  • Abstract
    In previous research interconnection was optimised when the module allocation for the operations and the register allocation for the variables already had been done. However, both the amount of multiplexing and interconnect are crucial factors to both the delay and the area of a circuit. In this paper it is shown that when variables are grouped into register files and operations are assigned to modules to minimise the interconnections, significant savings (20%) can be obtained in the number of local interconnections and the amount of global interconnect on the expense of only slightly more register area. This can be enhanced by splitting read and write phases of registers and even more by introducing serial (re-) write operations for the same value. The variable grouping is based on edge colouring algorithms that provide a sharp upper bound on the number of colours needed
  • Keywords
    circuit layout CAD; optimisation; area; data path allocation; delay; interconnect optimisation; multiplexing; register allocation; register files; Cost function; Delay; Flow graphs; Integrated circuit interconnections; Merging; Minimization; Multiplexing; Registers; Telephony; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference, 1990., EDAC. Proceedings of the European
  • Conference_Location
    Glasgow
  • Print_ISBN
    0-8186-2024-2
  • Type

    conf

  • DOI
    10.1109/EDAC.1990.136635
  • Filename
    136635