Timothy J. Callahan
ABSTRACT
By tailoring a compiler tree-parsing tool for datapath module mapping, we produce good quality results for datapath synthesis in very fast run time. Rather than flattening the design to gates, we preserve the datapath structure; this allows exploitation of specialized datapath features in FPGAs, retains regularity, and also results in a smaller problem size. To further achive high mapping speed, we formulate the problem as tree covering and solve it efficiently with a linear-time dynamic programming algorithm. In a novel extension to the tree-covering algorithm, we perform module placement simultaneously with the mapping, still in linear time. Integrating placement has the potential to increase the quality of the result since we can optimize total delay including routing delays.
To our knowledge this is the first effort to leverage a grammar-based tree covering tool for datapath module mapping. Further, it is the first work to integrate simultaneous placement with module mapping in a way that preserves linear time complexity.
- 1.AHO, A., AND GANAPATHI, M. Efficient Tree Pattern Matching: An Aid to Code Generation. In Conf. Record of the Twelfth Annual ACM Symposium on Principles of Programming L,anguages (Jan. 1985), pp. 334-340. Google Scholar
Digital Library
- 2.AHO, A., JOHI~SON, S., AND ULLMAN, J. Code Generation for Expressions with Common Subexpressions. Journal of the ACM 24, 1 (Jan. 1977), 146-60. Google ScholarDigital Library
- 3.AMARASINGHE, S. P., ANDERSON, J. M., WILSON, C. S., LIAO, S.-W., MURPHY, B. M., FRENCH, R. S., LAM, M. S., AND HALL, M.W. Multiprocessors from a Software Perspective. IEEE Micro 16, 3 (June 1996), 52--61. See also http://suif, stanford.eduL Google ScholarDigital Library
- 4.CHAUDHARY, K., AND PEDRAM, M. A Near Optimal Algorithm for Technology Mapping Minimizing Area Under Delay Constraints. In Prec. 29th ACM/iEEEDesign Automation Conference DAC '92 (June 1992), IE~ Computer Society Press, pp. 492- 498. Google Scholar
- 5.DEHON, A. DPGA-Coupled Microprocessors: Commodity ICs for the Early 21st Century. In Proceedings IEEE Workshop on FPGAs for Custom Computing Machines (Cat. No. 94TH0611-4) (1994), IEEE Comput. Soc. Press, pp. 31-9. AN4754544.Google Scholar
- 6.FRANCIS, R. Technology Mappingfi~r lamkup.Table Based Field- Programmable Gate Arrays. PhD thesis, University of Toronto, 1992.Google Scholar
- 7.FRASER, C., AND HANSON, D. A Retargetable C Compiler: Design and Implementation. Benjamin/Cummings, 1995. Google ScholarDigital Library
- 8.H^usF. R, J., AND W^WRZYt, mK, J. Garp: A MIPS Processor ' with a Reconfigurable Coprocessor. In Proceedings of IEEE Symposium on FPGAs for Custom Computing Machines (Napa, CA, Apr. 1997), K. L. Pocek and J. M. Arnold, Eds. Google ScholarDigital Library
- 9.KERR, K. DAGON: Technology Binding and Local Optimization by DAG Matching. In Proc. 24th ACM/IEEE Design Automation Conference (1987), ACM, pp. 341-347. Google ScholarDigital Library
- 10.KOCH, A. Module Compaction in FPGA-based Regular Datapaths. In Prec. 33rd ACM/IEEE Design Atttomation Conference (1996), ACM. Google ScholarDigital Library
- 11.Koch, A. Structured Design Implementation-A Strategy for Implementing Regular Datapaths on FPGAs. In Prim. ACM/SIGDA International Symposium on Field Programmable Gate Arrays (Monterey CA USA, 1996), ACM, pp. 151-157. Google ScholarDigital Library
- 12.LOU, J., SALEK, A. H., AND PEDRAM, M. AnExact Solution to Simultaneous Technology Mapping and Linear Placement Problem for Trees. In Prec. International Workshop on Logic Synthesis (May 1997), pp. 1--4.Google Scholar
- 13.NASEER, A., BALAKRISHNAN:, M., AND KUMAR, A. An Efficient Technique for Mapping RTL Structures onto FPGAs. in Proc. 4th International Workshop on Field-Programmable Logic and Applications, FPL '94 (Prague, Czech Republic, Sept. 1994), Springer-Verlag, pp. 99-I 10. Google ScholarDigital Library
- 14.NATIONAL SEMICONDUCTOR CORPORATION. NAPAi000 Data Sheet, 1996.Google Scholar
- 15.TJiANG, S. Twig Reference Manual. Comp. Sci. Tech. Rep. 120, AT&T Bell Laboratories, January 1986.Google Scholar
- 16.XILINX. The Programmable Logic Data Book. 1994.Google Scholar
Index Terms
- Fast module mapping and placement for datapaths in FPGAs
Recommendations
Placement-driven technology mapping for LUT-based FPGAs
FPGA '03: Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arraysIn this paper, we study the problem of placement-driven technology mapping for table-lookup based FPGA architectures to optimize circuit performance. Early work on technology mapping for FPGAs such as Chortle-d[14] and Flowmap[3] aim to optimize the ...
Structure-Aware Placement Techniques for Designs With Datapaths
As technology scales and frequencies increase, a new hybrid design style emerges, wherein designs contain a mixture of random logic and datapath standard-cell components. This paper demonstrates that conventional half-perimeter wirelength driven placers ...
Fast placement approaches for FPGAs
Recent trends in FPGA development indicate a strong shift toward design reuse through the use of intellectual property (IP). This design shift has motivated the development of Frontier, a timing-driven FPGA placement system that uses design macroblocks ...
Comments