An analytical model relating FPGA architecture and place and route runtime

This paper presents an analytical model that relates the architectural parameters of an FPGA to the place-and-route runtimes of the FPGA CAD tools. We consider both a simulated annealing based placement algorithm employing a bounding box wirelength cost function, and a negotiation based A^* router. We also show an example application of the model in early architecture evaluation.