Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Paul D. Kundarewich

dblp:19/5186 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Electronic design automation · 88% Reconfigurable computing and FPGAs · 12%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.122008
Architecture-specific packing for virtex-5 FPGAs · FPGA 2008
Synthetic circuit generation using clustering and iteration · FPGA 2003
Electronic design automation › benchmark generation
synthetic circuit generation
0.122004
Synthetic circuit generation using clustering and iteration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Synthetic circuit generation using clustering and iteration · FPGA 2003
Electronic design automation › physical design
packing
0.112008
Architecture-specific packing for virtex-5 FPGAs · FPGA 2008
Electronic design automation › benchmark generation
benchmark circuit generation
0.122004
Synthetic circuit generation using clustering and iteration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Synthetic circuit generation using clustering and iteration · FPGA 2003
Electronic design automation
design benchmarking
0.012003
Synthetic circuit generation using clustering and iteration · FPGA 2003
Reconfigurable computing and FPGAs
FPGA architecture
0.022008
Architecture-specific packing for virtex-5 FPGAs · FPGA 2008
Synthetic circuit generation using clustering and iteration · FPGA 2003

Methods — techniques the papers use, named apart from their topics

iterative generation · 0.1clustering · 0.1placement-based packing · 0.1dual-output LUT · 0.1
YearPublicationVenuePosition
2009 Packing Techniques for Virtex-5 FPGAs
abstract
Packing is a key step in the FPGA tool flow that straddles the boundaries between synthesis, technology mapping and placement. Packing strongly influences circuit speed, density, and power, and in this article, we consider packing in the commercial FPGA context and examine the area and performance trade-offs associated with packing in a state-of-the-art FPGA---the Xilinx ® Virtex TM -5 FPGA. In addition to look-up-table (LUT)-based logic blocks, modern FPGAs also contain large IP blocks. We discuss packing techniques for both types of blocks. Virtex-5 logic blocks contain dual-output 6-input LUTs. Such LUTs can implement any single logic function of up to 6 inputs, or any two logic functions requiring no more than 5 distinct inputs. The second LUT output has reduced speed, and therefore, must be used judiciously. We present techniques for dual-output LUT packing that lead to improved area-efficiency, with minimal performance degradation. We then describe packing techniques for large IP blocks, namely, block RAMs and DSPs. We pack circuits into the large blocks in a way that leverages the unique block RAM and DSP layout/architecture in Virtex-5, achieving significantly improved design performance.
Taneem Ahmed, Paul D. Kundarewich, Jason Helge Anderson
ACM Trans. Reconfigurable Technol. Syst.2
2008 Architecture-specific packing for virtex-5 FPGAs
abstract
We consider packing in the commercial FPGA context and examine the speed, performance and power trade-offs associated with packing in a state-of-the art FPGA -- the Xilinx Virtex-5 FPGA. Two aspects of packing are discussed: 1)packing for general logic blocks, and 2 packing for large IP blocks. Virtex-5 logic blocks contain dual-output 6-input look-up-tables (LUTs). Such LUTs can implement any single logic function requiring no more than 6 inputs, or any two logic functions requiring no more than 5 distinct inputs. The second LUT output is associated with slower speed, and therefore, must be used judiciously. We present placement-based techniques for dual-output LUT packing that lead to improved area-efficiency and power, with minimal performance degradation. We then move on to address packing for large IP blocks, specifically, block RAMs and DSPs. We present a packing optimization that is widely applicable in DSP designs that leads to significantly improved design performance
Taneem Ahmed, Paul D. Kundarewich, Jason Helge Anderson, Brad L. Taylor, Rajat Aggarwal
FPGA2
2004 Synthetic circuit generation using clustering and iteration
abstract
The development of next-generation computer-aided design tools and field programmable gate array architectures require benchmark circuits to experiment with new algorithms and architectures. There has always been a shortage of good public benchmarks for these purposes, and even companies that have access to proprietary customer designs could benefit from designs that meet size and other particular specifications. In this paper, we present a new method of generating realistic synthetic benchmark circuits to help alleviate this shortage. The method significantly improves the quality of previous work by imposing a hierarchy of circuits through clustering and by using a simpler method of characterizing the nature of sequential circuits. Also, in contrast to current constructive generation methods (Hutton et al., 1998), (Hutton et al., 2002), (Darnauer and Dai, 1996), (Iwama and Hino, 1994), (Iwama et al., 1997), (Harlow and Brglez, 1997), (Ghosh et al., 1998), (http://www.cbl.ncsu.edu//spl bsol/-publications //spl bsol/-/spl bsol/#2000-TR@CBL-01-Ghosh), (Pistorius et al., 2000), (Stroobandt et al., 2000), (Verplaetse et al., 2002), we employ new iterative techniques in the generation that provide better control over the generated circuit's characteristics. As in previous work, we assess the realism of the generated circuits by comparing properties of real circuits and generated "clones" of the real circuit after placement and routing. On average, the real and clone circuits' total detailed wirelength differ by only 14%, a major improvement over previous results. In addition, the minimum track count is within 14% and the critical-path delay is within 10%.
Paul D. Kundarewich, Jonathan Rose
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2003 Synthetic circuit generation using clustering and iteration
abstract
The development of next-generation CAD tools and FPGA architectures requires benchmark circuits to experiment with new algorithms and architectures. There has always been a shortage of good public benchmarks for these purposes, and even companies that have access to proprietary customer designs could benefit from designs that meet size and other particular specifications. In this paper, we present a new method of generating realistic synthetic benchmark circuits to help alleviate this shortage. The method significantly improves the quality of previous work by imposing the natural hierarchy of circuits through clustering and by using a simpler method of characterizing the nature of sequential circuits. Also, in contrast to current constructive generation methods, we employ new iterative techniques in the generation that provide better control over the generated circuit s characteristics. As in previous work, we assess the realism of the generated circuits by comparing properties of real circuits and generated "clones" of the real circuit after placement and routing. On average, the real and clone circuits' total detailed wirelength differed by only 14%, a major improvement over previous results. In addition, the minimum track count was within 14% and the critical path delay was within 10%.
Paul D. Kundarewich, Jonathan Rose
FPGA1