Placement rent exponent calculation methods, temporal behaviour and FPGA architecture evaluation

  • Authors:
  • Joachim Pistorius;Mike Hutton

  • Affiliations:
  • Altera Corp., San Jose, CA;Altera Corp., San Jose, CA

  • Venue:
  • Proceedings of the 2003 international workshop on System-level interconnect prediction
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the design of FPGA architectures, it is important to understand wiring requirements of placed circuits. Rent's Rule is an empirical metric of connectivity and congestion in a circuit that has applications in the prediction of interconnect usage.Traditional methods of calculating Rent exponents are based on recursive partitioning, with the exception of some recent work [21], [22] that defines an alternative Rent exponent of a circuit based on a placement-induced partitioning tree.In this paper we take a different look at the calculation of Rent exponents in placement, contrasting several different methods empirically and outlining the relevant biases in each. We will compare the Rent exponent observed for timing-driven vs. purely congestion-driven placement algorithms, and for different types of benchmark circuits. We also observe the temporal behaviour of Rent exponents through a simulated annealing placement and its correlation to the placement cost function and wirelength. Finally we apply the empirical results to the analysis of the Cyclone FPGA architecture and comment on the routability of the device.