Efficient circuit clustering for area and power reduction in FPGAs

ACM Transactions on Design Automation of Electronic Systems

Volumn 7, Issue 4, 2002, Pages 643-663

  Singh, Amit ^a   Parthasarathy, Ganapathy ^b   Marek Sadowska, Malgorzata ^b  

^a XILINX INC   (United States)

^b Santa Barbara   (United States)

Author keywords

Clustering; Congestion; FPGA; Interconnect; Placement; Power; Rent

Indexed keywords

ALGORITHMS; INTEGRATED CIRCUITS; LOGIC DESIGN; TRANSISTORS;

CIRCUIT CLUSTERING;

FIELD PROGRAMMABLE GATE ARRAYS;

EID: 0036826796     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/605440.605448     Document Type: Article

References (26)

1. ALEXANDER, M. J., COHOON, J. P., GANLEY, J. L., AND ROBINS, G. 1994. An architecture-driven approach to FPGA routing using multi-weighted graphs. In Proceedings of Euro-DAC, 259-264.
2. ALTERA, INC. Available at http://www.altera.com
3. BETZ, V. AND ROSE, J. 1997a. VPR: A new packing, placement and routing tool for FPGA research. In Proceedings of the Seventh FPLA, 213-222.
4. BETZ, V. AND ROSE, J. 1997b. Cluster-based logic blocks for FPGAs: Area-efficiency vs. input sharing and size. In Proceedings of the IEEE Custom Integrated Circuits Conference, 551-554.
5. BETZ, V. ROSE, J., AND MARQUARDT, J. 1999. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic, Hingham, Mass.
6. BOZORGZADEH, E., OGRENCI-MEMIK, S., AND SARRAFZADEH, M. 2001. RPack: Routability-driven packing for cluster-based FPGAs. In Proceedings of the Asia-South Pacific Design Automation Conference (January), 629-634.
7. BROWN, S., ROSE, J., AND VRANESIO, Z. G. 1993. A stochastic model to predict the routability of field programmable gate arrays. IEEE Trans. Comput. Aided Des. (Dec.), 1827-1838.
8. CHAN, P. K., SCHLAG, M. D., AND ZIEN, J. Y. 1993. On routability prediction for field programmable gate-arrays. In Proceedings of the Design Automation Conference, 326-330.
9. CONG, J. AND DING, Y. 1994. FlowMap: An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. IEEE Trans. Comput. Aided Des. 13 (Jan.), 1-12.
10. DEHON, A. 1999. Balancing interconnect and computation in a reconfigurable array (or why you don't really want 100% LUT utilization. In Proceedings of the Field Programmable Gate Array Symposium.
11. DEVADAS, S. 1989. Optimal layout via Boolean satisfiability. In Proceedings of the International Conference on Computer Aided Design, 294-297.
12. DONATH, W. E. 1979. Placement and average interconnect requirements of computer logic. IEEE Trans. Circ. Syst. CAS-26, 272-277.
13. EL GAMAL, A. A. 1981. Two-dimensional stochastic model for interconnections in master-slice integrated circuits. IEEE Trans. Circ. Syst. CAS-28, 127-138.
14. HAGEN L., KAHNG, A. B., AND KURDHI, F. J. 1994. On the intrinsic rent parameter and spectra-based partitioning methodologies. IEEE Trans. Comput. Aided Des. 13, 1 (Jan.), 27-36.
15. KIRKPATRICK, S., GELATT, C. D., AND VECCHI, M. P. 1983. Optimization by simulated annealing. Science, 220, 671-680.
16. LANDMAN, B. S. AND RUSSO, R. L. 1974. On a pin versus block relationship for partitions of logic graphs. IEEE Trans. Comput. C-20, 1469-1479.
17. VAN MARCK, H., STROOBANDT, D., AND VAN CAMPENHOUT, J. 1995. Towards an extension of Rent's rule for describing local variations in interconnect complexity. In Proceedings of the Fourth International Symposium for Young Computer Scientists, 136-141.
18. MARQUARDT, A., BETZ, V., AND ROSE, J. 2000. Speed and area tradeoffs in cluster-based FPGA architectures. IEEE Trans. VLSI Sys. (Feb.), 84-93.
19. PARTHASARATHY, G., MAREK-SADOWSKA, M., MUKHERJEE, A., AND SINGH, A. 2001. Interconnect-complexity aware placement for FPGAs using Rent's rule. In Proceedings of the Third System Level Interconnect Prediction Workshop, 115-121.
20. SCHEFFER, L. AND NEQUIST, E. 2000. Why interconnect prediction doesn't work. In Proceedings of the Second System Level Interconnect Prediction Workshop, 139-144.
21. SINGH, A., PARTHASARATHY, G., AND MAREK-SADOWSKA, M. 2001. Interconnect-resource aware placement for hierarchical FPGAs. In Proceedings of the International Conference on Computer-Aided Design, 132-136.
22. STROOBANDT, D., VERPLAESTE, S. P., AND VAN CAMPENHOUT, J. 2000. Generating synthetic benchmark circuits for evaluating CAD tools. IEEE Trans. Comput. Aided Des. 19, 9 (Sept.) 1011-1022.
23. WOOD, R. G. AND RUTENBAR, R. A. 1997. FPGA routing and routability estimation using Boolean satisfiability. In Proceedings of the International. Symposium on FPGAs, 119-125.
24. WU, Y. L., TSUKIYAMA, S., AND MAREK-SADOWSKA, M. 1996. Graph based analysis of 2-D FPGA routing. IEEE Trans. Comput. Aided Des. 1 (Jan.), 33-44.
25. ZARKESH-HA, P., DAVIS, J. A., AND MEINDL, J. D. 2000. Prediction of net-length distribution for global interconnects in a heterogeneous system-on-a-chip. IEEE Trans. VLSI 8, 6 (Dec.), 649-659.
26. XILINX INC. 2000. Available at http://www.xilinx.com