Performance-Driven Partitioning Using a Replication Graph Approach

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.

[1]  Ernest S. Kuh,et al.  Performance-driven system partitioning on multi-chip modules , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[2]  Chung-Kuan Cheng,et al.  Data Flow Partitioning for Clock Period and Latency Minimization , 1994, 31st Design Automation Conference.

[3]  Keshab K. Parhi,et al.  Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding , 1991, IEEE Trans. Computers.

[4]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[5]  A. Richard Newton,et al.  A cell-replicating approach to minicut-based circuit partitioning , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[6]  Ernest S. Kuh,et al.  Quadratic Boolean Programming for Performance-Driven System Partitioning , 1993, 30th ACM/IEEE Design Automation Conference.

[7]  Chung-Kuan Cheng,et al.  A replication cut for two-way partitioning , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[9]  Paul D. Franzon,et al.  Multichip Module Technologies and Alternatives: The Basics , 1992, Springer US.

[10]  Abbas El Gamal,et al.  Optimal replication for min-cut partitioning , 1992, ICCAD.