DocumentCode
3162437
Title
Performance-Driven Partitioning Using a Replication Graph Approach
fYear
1995
fDate
1995
Firstpage
206
Lastpage
210
Abstract
An efficient algorithm is proposed to tackle the performance-driven partitioning problem using retiming and replication. We devise a replication graph to model the composite effect of replication and retiming. With the replication graph, we formulate the problem as an integer linear programming problem. A heuristic algorithm is derived to solve the problem by exploring the dual program of its linear programming relaxation.
Keywords
Circuits; Clocks; Computer science; Delay effects; Integer linear programming; Partitioning algorithms; Permission; Propagation delay; Registers; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1995. DAC '95. 32nd Conference on
Conference_Location
San Francisco, CA
ISSN
0738-100X
Print_ISBN
0-89791-725-1
Type
conf
DOI
10.1109/DAC.1995.250091
Filename
1586703
Link To Document