Publication

Routage detaillé de circuits integrés par recuit simulé

Thomas Liebling
1988
Journal Articles

Abstract

In this paper we present an application of simulated annealing to the detailed routing of integrated circuits. This application is based on local modifications to a simple, but generally inacceptable, initial configuration. The new configurations so generated are evaluated through a cost function incorporating strong penalties for the illegal situations. The results are satisfactory, but we are still studying the algorithm behaviour as a function of its parameters.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Thomas Liebling
1988
Journal Articles

Abstract

Official source

Related concepts (21)

Integrated circuit

An integrated circuit or monolithic integrated circuit (also referred to as an IC, a chip, or a microchip) is a set of electronic circuits on one small flat piece (or "chip") of semiconductor material, usually silicon. Large numbers of miniaturized transistors and other electronic components are integrated together on the chip. This results in circuits that are orders of magnitude smaller, faster, and less expensive than those constructed of discrete components, allowing a large transistor count.

Simulated annealing

Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space for an optimization problem. For large numbers of local optima, SA can find the global optima. It is often used when the search space is discrete (for example the traveling salesman problem, the boolean satisfiability problem, protein structure prediction, and job-shop scheduling).

Local search (optimization)

In computer science, local search is a heuristic method for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate solutions. Local search algorithms move from solution to solution in the space of candidate solutions (the search space) by applying local changes, until a solution deemed optimal is found or a time bound is elapsed.

Related publications (7)

Routage detaillé de circuits integrés par recuit simulé

Chat with Graph Search

Surface potential compact model for embedded flash devices oriented to IC memory design

The influence of regulatory uncertainty on investments

High-throughput surface patterning with wafer-sized stencils fabricated by a DUV/MEMS process