DocumentCode :
2560072
Title :
Relative location assignment for repetitive schedules
Author :
Van Meerbergen, J.L. ; Lippens, P.E.R. ; Verhaegh, W.F.J. ; van der Werf, A.
Author_Institution :
Philips Res. Labs., Eindhoven, Netherlands
fYear :
1993
fDate :
22-25 Feb 1993
Firstpage :
403
Lastpage :
407
Abstract :
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
Keywords :
circuit layout CAD; high level synthesis; scheduling; storage allocation; Matchbox; Phideo synthesis system; fast algorithm; high-level synthesis; relative location assignment; repetitive schedules; storage synthesis; High level synthesis; Integrated circuit synthesis; Registers; Scheduling algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on
Conference_Location :
Paris
Print_ISBN :
0-8186-3410-3
Type :
conf
DOI :
10.1109/EDAC.1993.386442
Filename :
386442
Link To Document :
بازگشت