2011 · 18 citations · 15 references
EngineeringComputer EngineeringComputer ScienceDesign AutomationDesign OptimizationVlsi DesignLayout DesignLayout EvaluationLayout OptimizationPlacement TestingVery-large-scale Integration LayoutCustom Datapath DesignDatapath DesignLayout BenchmarkingLayout Performance MetricsPlacementPlacement AlgorithmsQuantitative Layout ComparisonTest Cases
There have been significant prior efforts to quantify performance of academic placement algorithms, primarily by creating artificial test cases that attempt to mimic real designs, such as the PEKO benchmark containing known optimas [5]. The idea was to create benchmarks with a known optimal solution and then measure how far existing placers were from the known optimal. Since the benchmarks do not necessarily correspond to properties of real VLSI netlists, the conclusions were met with some skepticism. This work presents two custom constructed datapath designs that perform common logic functions with hand-designed layouts for each. The new generation of academic placers is then compared against them to see how the placers performed for these design styles. Experiments show that all academic placers have wirelengths significantly greater then the manual solution; solutions range from 1.75 to 4.88 times greater wirelengths. These testcases will be released publically to stimulate research into automatically solving structured datapath placement problems.
15
Computer architecture: a quantitative approach
Martin Shute · Microelectronics Journal · 1993 · 3.4K citations
Tony F. Chan, Jason Cong, Joseph R. Shinnerl et al. · 2006 · 205 citations
Natural Sciences, Computer Engineering, Computer Science +13
The ISPD2005 placement contest and benchmark suite
Gi-Joon Nam, Charles J. Alpert, Paul G. Villarrubia et al. · 2005 · 174 citations