Paper Review-Routeing according to a Structured Btplanar Scheme in Printed Boards," G. Alia, G. Frestnt and P. Haestrini, Computer Aided Design, Vol. 5 No. 3 (July 1973), pp. 152-159. The problem described involves placement and tnterconnectton of a single module type on two layer boards. Modules are assigned to one side of the board, with the legal locations forming a uniform grid. A channel-type routine scheme is used, with horizontal and vertical channels on separate layers. The procedures described seek to minimize conducting path area, hence (indirectly) total path length. Via count and engineering constraints are apparently not considered. Module placement starts with cedomposltton of the modules tnto column sets, ustng connectivity within and between column sets as the basis for partitioning. Connectivity within column set ts used to determine relative positioning within column. Column adjacency detemtnatton resembles some force-directed placement schemes, although, column orientation appears to have been arbitrary. A conventional channel router scheme is used to determine tnterconnectton paths. The technique was implemented in APL on a S/360-67. The following results are extracted from the text of the paper. A pseudo-random problem containing 6 rows and 7 columns of legal locations contained 42 modules (14 pins each). Colum Assignment Module Exchanges Module Ordering Column OrdeFlng Horizontal Segment Distribution Horizontal SegmentAssignment Vertical Segment Assignment Total MIN T 30 3 i 0 0 2 42 SEC ~T" 1 51 II P1acement Interconnectlon 34 39 .47 39 The system required 20,000 bytes of memory, according to the authors. Based on experimental analysis, the authors conclude that the module exchange plase of column (cluster) assignment is unjustified and should be omitted. Rob S~nlth
/lp/association-for-computing-machinery/review-of-routeing-according-to-a-structured-biplanar-scheme-in-Wle6pkuQ0I