Relative location assignment for repetitive schedules

The authors point out that storage synthesis is becoming an important part of high-level synthesis. Emphasis is put on location assignment, i.e., the assignment of locations to variables in a storage unit. The technique of relative location assignment is discussed. This technique combines a fast algorithm (O(n log n)) with an efficient solution because at most one location more than the strict minimum is needed. As a consequence, the technique is particularly suited for large applications. This is illustrated using some real-life examples. The technique is implemented in a tool, called Matchbox, which is part of the Phideo synthesis system.<
>