Learn More
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing has grown more dramatically than the compute power of the available computers. Second, there exists a subset of users who are willing to accept a reduction in the quality 1 of result(More)
1994 We investigate constraint relaxation within a general constraint model. We claim that a key to relaxation is recognition that a constraint can be modified in a variety of ways and that each modification potentially carries a different impact for both the quality of the solution and the problem solving process. Our primary motivation is the application(More)
Ultra-Fast Automatic Placement for FPGAs The demand for high-speed Field-Programmable Gate Array (FPGA) compilation tools has escalated for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing of circuits has grown more dramatically than the available computer power. Second, there exists a subset of(More)
With recent advances in silicon device technology, a new branch of computer architecture, reconngurable computing, has emerged. While this computing domain holds the promise of exceptional ne-grained parallel performance, the amount of time required to compile a program to a reconngurable computing platform can be prohibitive for many applications. A large(More)
  • 1