IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1998 · 40 citations · 27 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureDesign OptimizationField-programmable Gate ArraysField-programmable Gate Array ArchitectureFpga ArchitectureLayout OptimizationPhysical DesignRoutingTiming AnalysisField-programmable Gate Arrays (Fpgas)Iterative ImprovementPlacementPlacement AlgorithmsPlacement ArchitectureRouting In Field-programmable Gate ArraysSimultaneous PlacementTiming
Sequential place and route tools for field programmable gate arrays (FPGA's) are inherently weak at addressing both wirability and timing optimizations. This is primarily due to the difficulty of accurately predicting wirability and delay during placement. A set of new performance-driven simultaneous placement/routing techniques has been developed for both row-based and island-style FPGA designs. These techniques rely on an iterative improvement placement algorithm augmented with fast, complete routing heuristics in the placement loop. For row-based designs, this new layout strategy yielded up to 28% improvements in timing and 33% in wirability for several MCNC benchmarks when compared to a traditional sequential place and route system in use at Texas Instruments. On a set of industrial designs for Xilinx 4000-series island-style FPGA's, our scheme produced 100% routed designs with 8-15% improvement in delay when compared to the Xilinx XACT5.0 place and route system.
27
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
An Algorithm for Path Connections and Its Applications
C. Y. Lee · IEEE Transactions on Electronic Computers · 1961 · 1.6K citations
L. McMurchie, Carl Ebeling · 1995 · 688 citations
Computing, Computer Science, Community-based Participatory Research +12