Linear ordering by stochastic evolution

Author

Saab, Youssef ; Rao, Vasant

Author_Institution

Dept. of Comput. Sci., Missouri Univ., Columbia, MO, USA

fYear

1991

fDate

4-8 Jan 1991

Firstpage

130

Lastpage

135

Abstract

Linear ordering has applications in standard cells and gate array placement. This paper presents a new approach to linear ordering based on the new stochastic evolution (SE) methodology for solving intractable combinatorial optimization problems. The SE heuristic performs better than Kang´s heuristic and simulated annealing. In many cases, the SE heuristic was significantly better than Kang´s heuristic, and an order of magnitude better than simulated annealing

Keywords

cellular arrays; circuit layout; logic arrays; network topology; stochastic programming; SE heuristic; gate arrays; intractable combinatorial optimization problems; linear ordering; placement; standard cells; stochastic evolution; Application software; Circuit simulation; Computational modeling; Computer science; Costs; Simulated annealing; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

VLSI Design, 1991. Proceedings., Fourth CSI/IEEE International Symposium on

Conference_Location

New Delhi

Print_ISBN

0-8186-2125-7

Type

conf

DOI

10.1109/ISVD.1991.185105

Filename

185105

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2888571