Placement-routing
The placement-routing is a term used in electronic to indicate the process at the time from which the various parts of a circuit are automatically positioned and connected according to the problem to solve. The placement-routing is employed in particular within the framework of FPGA, of the reprogrammable components with thousands of internal treatment units which can be connected between them.
The placement-routing is a difficult problem of Optimization which requires techniques Métaheuristique S like the genetic algorithms or the Recuit simulated. The computing times are thus often very high within sight of the number of elements to consider. It is however possible to leave a room for maneuver to the algorithm to obtain an acceptable solution more quickly but not-optimal.
| Random links: | Zellig Harris | Raphaël Chercheve | Hylesinus oleiperda | Manù | The Color fallen from the sky | Homme-ch'ing_de_Cheng |