Affiliation:
1. Nan-Hua University, Taiwan
2. Realtek Semiconductor Corp., Taiwan
3. National Taiwan University, Taipei, Taiwan
Abstract
In this article, we introduce a new placement problem motivated by the Dynamically Reconfigurable FPGA (DRFPGA) architectures. Unlike traditional placement, the problem for DRFPGAs must consider the precedence constraints among logic components. For the placement, we develop an effective metric that can consider wirelength, register requirement, and power consumption simultaneously. With the considerations of the new metric and the precedence constraints, we then present a three-stage scheme of partitioning, initial placement generation, and placement refinement to solve the new placement problem. Experimental results show that our placement scheme with the new metric achieves respective improvements of 17.2, 27.0, and 35.9% in wirelength, the number of registers, and power consumption requirements, compared with the list scheduling method.
Publisher
Association for Computing Machinery (ACM)
Subject
Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications
Reference25 articles.
1. Bhat N. B. Chaudhary K. and Hah E. S. 1993. Performance-oriented fully routable dynamic architecture for a field programmable logic dervice. Memorandum No. UCB/RELM93/42 University of California Berkeley. Bhat N. B. Chaudhary K. and Hah E. S. 1993. Performance-oriented fully routable dynamic architecture for a field programmable logic dervice. Memorandum No. UCB/RELM93/42 University of California Berkeley.
2. Brglez F. 1993. ACM/SIGDA design automation benchmarks: Catalyst or anathema? IEEE Des. Test Sept. 87--91. Brglez F. 1993. ACM/SIGDA design automation benchmarks: Catalyst or anathema? IEEE Des. Test Sept. 87--91.