Journal Article10.1109/43.511568
Performance optimization using template mapping for datapath-intensive high-level synthesis
109
TL;DR: This paper introduces a new approach to performance-driven template mapping for high-level synthesis that focuses on datapath-intensive ASIC design, though the concepts are also highly applicable to compiler development.
read more
Abstract: This paper introduces a new approach to performance-driven template mapping for high-level synthesis. Template mapping, the process of mapping high-level algorithmic descriptions to specialized hardware libraries or instruction sets, involves template matching, template selection, and clock selection. Efficient algorithms for each are presented, and novel issues such as partial matching are addressed. The paper focuses on datapath-intensive ASIC design, though the concepts are also highly applicable to compiler development. Experimental results on examples from real applications show significant improvements in throughput with limited area overhead.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits
Ebrahim M. Songhori,Siam U. Hussain,Ahmad-Reza Sadeghi,Thomas Schneider,Farinaz Koushanfar +4 more
- 17 May 2015
TL;DR: Tiny Garble achieves an unprecedented level of compactness and scalability by using a sequential circuit description for GC, and is able to implement functions that have never been reported before, such as SHA-3.
Instruction generation for hybrid reconfigurable systems
TL;DR: This work presents an algorithm for simultaneous template generation and matching, which can be applied to any type of graph, including directed graphs and hypergraphs, and targets the strategically programmable system.
211
Pattern-based behavior synthesis for FPGA resource reduction
Jason Cong,Wei Jiang +1 more
- 24 Feb 2008
TL;DR: This paper presents a general pattern-based behavior synthesis framework which can efficiently extract similar structures in programs and applies it to FPGA resource optimization with the observation that multiplexors are particularly expensive on FPGAs.
A graph covering algorithm for a coarse grain reconfigurable system
Yuanqing Guo,Gerard J.M. Smit,Hajo Broersma,P.M. Heysters +3 more
- 11 Jun 2003
TL;DR: A graph covering algorithm that can find all distinct templates with multiple outputs using unique serial numbers and circle numbers and shows how this information can be used in compilers for reconfigurable systems.
58
Copy detection for intellectual property protection of VLSI designs
Andrew B. Kahng,Darko Kirovski,Stefanus Mantik,Miodrag Potkonjak,Jennifer L. Wong +4 more
- 07 Nov 1999
TL;DR: This work proposes a generic methodology for copy detection based on determining basic elements within structural representations of solutions (IPs), calculating (context-independent) signatures for such elements, and performing fast comparisons to identify potential violators of IP rights.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
Introduction to algorithms: 4. Turtle graphics
TL;DR: In this article, a language similar to logo is used to draw geometric pictures using this language and programs are developed to draw geometrical pictures using it, which is similar to the one we use in this paper.
15.4K