Linear Ordering and Application to Placement

Given a set of interconnected elements, linear ordering generates a linear sequence of elements of the set, which is the basis for most constructive initial-placement methods. This paper presents a new strategy for linear ordering. The important difference of the new technique from the previous ones is that it starts the ordering process from the most lightly connected seed. It was applied to various placement problems including standard cell and gate array and produced very good results.