Incremental Design Methodology for Multimillion-gate Fpgas
نویسندگان
چکیده
This paper presents an FPGA design methodology that can be used to shorten the FPGA design-and-debug cycle, especially as the gate counts increase to multi-millions. Core-based incremental placement algorithms, in conjunction with fast interactive routing, are investigated to reduce the design processing time by distinguishing the changes between design iterations and reprocessing only the changed blocks without affecting the remaining part of the design. When combined with a background refinement thread, the incremental approach offers the instant gratification that designers expect, while preserving the fidelity attained through batch-oriented programs. An integrated FPGA design environment is then developed based on the incremental placer and its background refiner. The results show that the incremental design methodology is orders of magnitude faster than the competing approaches such as the Xilinx M3 tools without sacrificing too much quality.
منابع مشابه
Matching-based algorithm for FPGA channel segmentation design
Process technology advances have made multimillion gate field programmable gate arrays (FPGAs) a reality. A key issue that needs to be solved in order for the large-scale FPGAs to realize their full potential lies in the design of their segmentation architectures. Channel segmentation designs have been studied to some degree in much of the literature; the previous methods are based on experimen...
متن کاملAutomated Incremental Design of Flexible Intrusion Detection Systems on FPGAs
Intrusion detection for network security is a computeintensive application demanding high system performance. This paper presents a variety of strategies we have developed for the automatic synthesis of highly efficient intrusion detection systems. We create FPGA architectures using a high-level, graph-based partitioning methodology. We provide a library of performancecustomized architectures, ...
متن کاملParaFPGA 2011 High Performance Computing with Multiple FPGAs: Design Methodology and Applications
ParaFPGA 2011 marks the third mini-symposium devoted to the methodology, design and implementation of parallel applications using FPGAs. The focus of the contributions is mainly on organizing parallel applications in multiple FPGAs. This includes experiences from building a supercomputer with FPGAs, automatic and dedicated balancing of different tasks on heterogeneous FPGA constellations and de...
متن کاملSecure FPGA Design by Filling Unused Spaces
Nowadays there are different kinds of attacks on Field Programmable Gate Array (FPGA). As FPGAs are used in many different applications, its security becomes an important concern, especially in Internet of Things (IoT) applications. Hardware Trojan Horse (HTH) insertion is one of the major security threats that can be implemented in unused space of the FPGA. This unused space is unavoidable to ...
متن کاملSuper-sized Multiplies: How Do FPGAs Fare in Extended Digit Multipliers?
Extended digit multiplication can be an effective benchmark for comparing contemporary CPUs to other architectures and devices. The Great Internet Mersenne Prime Search (GIMPS), a distributed computing effort to find large prime numbers, has produced highly optimized code for multiplying large, multimillion digit numbers on Pentium processors. This paper presents a hardware large integer multip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Circuits, Systems, and Computers
دوره 14 شماره
صفحات -
تاریخ انتشار 2005