| | |
Summary: REGISTER ALLOCATION USING CIRCULAR FIFOS
Imed Eddine Bennour El Mostapha Aboulhamid
Département d'Informatique et Recherche Opérationnelle
Université de Montréal
CP 6128 Centre Ville, Montréal, H3C-3J7, QC, CANADA
{aboulham,bennour}@iro.umontreal.ca
ABSTRACT
In this paper, we study the memory allocation problem in data
path synthesis. We propose a register organization called circular
FIFO as an alternative to register file organization. In comparison
with register file organization, FIFO organization eliminates the
overhead of address generation and decoding hardware. The
memory allocation problem, based on the circular FIFO
organization, has been solved efficiently using constraint logic and
interval constraint programming.
1. INTRODUCTION
A common approach to high level synthesis involves data-flow
graph scheduling, functional unit allocation, interconnection and
memory allocation. Memory allocation maps constants and
variables of a data-flow graph to storage elements (e.g., ROM,
|
