Quark Routing

With inherent problem complexity, ever increasing instance size and ever decreasing layout area, there is need in physical design for improved heuristics and algorithms. In this investigation, we present a novel routing methodology based on the mechanics of auctions. We demonstrate its efficacy by exhibiting the superior results of our auctionbased FPGA router QUARK on the standard benchmark suite.

• Type: Conference
• Year: 2003
• Where: FPL
• Authors: Sean T. McCulloch, James P. Cohoon
• Keywords: Fpga Router Quark, FPL 2003, Inherent Problem Complexity, Standard Benchmark Suite