A continuous valued iterative algorithm for wire routing problems

Author

Nagamatu, Masahiro ; Ismail, Shakeel ; Yanaru, Torao

Author_Institution

Kyushu Inst. of Technol., Fukuoka, Japan

Volume

1

fYear

1998

fDate

21-23 Apr 1998

Firstpage

348

Abstract

A continuous valued iterative algorithm LMR-FSC for wire routing problems is proposed. In this method, each wire is a non-discrete one (discrete means binary valued, 1=placed or 0=not placed), and has the value of real number between 0 and 1. The wire routing problem is formalized as an optimization problem, and LMR-FSC is based on Lagrangian method for the optimization problem. In this method overlapping of wires of different nets are accounted as cost, and the wires placed on higher cost parts of the routing area are gradually moved to lower cost parts. Experimental results show that continuousness works effectively for some wire routing problems

Keywords

circuit layout CAD; graph theory; iterative methods; LMR-FSC; Lagrangian method; continuous valued iterative algorithm; optimization problem; routing area; wire routing problems; Concurrent computing; Constraint optimization; Costs; Differential equations; Iterative algorithms; Lagrangian functions; Land mobile radio; Optimization methods; Routing; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

Knowledge-Based Intelligent Electronic Systems, 1998. Proceedings KES '98. 1998 Second International Conference on

Conference_Location

Adelaide, SA

Print_ISBN

0-7803-4316-6

Type

conf

DOI

10.1109/KES.1998.725870

Filename

725870