Skip to Main Content
This paper presents new algorithms for routing two rows of interchangeable terminals across a 2-layer channel. The number of horizontal tracks required for routing is significantly reduced by simply interchanging terminals in each cell. Savings up to one-third of horizontal tracks or more are achieved by interchanging terminals. The Deutsch Difficult Example is used as a test routing problem. The number of horizontal segments per net is limited to one, no "doglegs." The program is coded in Pascal and implemented on a VAX-11/780 computer.