Spectral-based multiway FPGA partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 15, Issue 5, 1996, Pages 554-560

  Chan, Pak K ^a   Schlag, Martine D F ^a   Zien, Jason Y ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; ITERATIVE METHODS; LOGIC GATES; OPTIMIZATION; SPECTRUM ANALYSIS; STANDARDS;

FIELD PROGRAMMABLE GATE ARRAYS; PARTITIONED SUBCIRCUITS; PARTITIONING; ROUTABILITY;

COMPUTER AIDED LOGIC DESIGN;

EID: 0030147897     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.506142     Document Type: Article

References (17)

1. R. Kuznar F. Brglez B. Zajc Multiway netlist partitioning into heterogeneous FPGA's and minimization of total device cost and interconnect Proc. ACM IEEE 31st Design Automation Conf. 238 243 June 1994 CA, San Diego
2. B. N. Parlett D. S. Scott The Lanczos algorithm with selective orthogonalization Math. Computat. 33 11 217 238 1979
3. The Programmable Gate Array Data Book 1993 XILINX CA, San Jose
4. P. K. Chan M. Schlag J. Zien On routability prediction for field-programmable gate arrays Proc. ACM IEEE 30th Design Automation Conf. 326 330 June 1993 TX, Dallas
5. N. Bhat D. Hill Routable technology mapping for LUT FPGA's Proc. IEEE Int. Conf. Computer Design: VLSI Comput. Process. 95 98 Oct. 1992 442 6840 276199
6. S. Trimberger M.-R. Chene Placement-based partitioning for lookup-table-based FPGA's Proc. IEEE Int. Conf. Computer Design: VLSI Comput. Process. 91 94 Oct. 1992 442 6840 276200
7. A. El Gamal Two-dimensional stochastic model for interconnections in master slice integrated circuits IEEE Trans. Circuits Syst. CAS-28 127 138 Feb. 1981
8. A. Pothen H. D. Simon K.-P. Liou Partitioning sparse matrices with eigenvectors of graphs SIAM J. Matrix Analysis Appl. 11 3 430 452 1990
9. P. K. Chan M. Schlag J. Zien Spectral $k$-way ratio-cut partitioning and clustering IEEE Trans. Computer-Aided Design 13 1088 1096 Sept. 1994 43 7534 310898
10. W. Donath A. Hoffman Lower bounds for the partitioning of graphs IBM J. Res. Develop. 17 5 420 425 1973
11. R. Kuznar F. Brglez K. Kozminski Cost minimization of partitions into multiple devices Proc. ACM IEEE 30th Design Automation Conf. 315 320 June 1993 TX, Dallas
12. J. Frankle R. M. Karp Circuit placements and cost bounds by eigenvector decomposition Proc. IEEE Int. Conf. Computer-Aided Design 414 417 Nov. 1986 CA, Santa Clara
13. N.-C. Chou L.-T. Liu C.-K. Cheung W.-J. Dai R. Lindelof Circuit partitioning for huge logic emulation systems Proc. ACM IEEE 31st Design Automation Conf. 244 249 June 1994 CA, San Diego
14. M. Schlag J. Kong P. K. Chan Routability-driven technology mapping for lookup table-based FPGA's IEEE Trans. Computer-Aided Design 13 13 26 Jan. 1994 43 6776 273753
15. N.-S. Woo J. Kim An efficient method of partitioning circuits for multiple-FPGA implementation Proc. ACM IEEE 30th Design Automation Conf. Proc. 202 207 June 1993 TX, Dallas
16. C. J. Alpert A. B. Kahng Multiway partitioning via spacefilling curves and dynamic programming Proc. ACM IEEE 31st Design Automation Conf. 652 657 June 1994 CA, San Diego
17. F. Rendl H. Wolkowicz A projection technique for partitioning the nodes of a graph Apr. 1991 University of Waterloo Ont., Waterloo Tech. Rep.