Accession Number:

AD0733861

Title:

On the Ordering of Connections for Automatic Wire Routing,

Descriptive Note:

Corporate Author:

ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s):

Report Date:

1971-11-01

Pagination or Media Count:

28.0

Abstract:

Most wire routing programs utilize a maze-running technique to route one connection at a time. Once routed, a wire cannot be moved even if it is subsequently discovered to interfere with the successful completion of other connections. The order in which the desired connections are presented to the routing algorithm has therefore been thought to be of critical importance. Experimental evidence is presented herein, however, to show that the performance of a router, when measured in terms of the total of the minimum or ideal lengths of the connections successfully completed, is in fact independent of the order in which connections are attempted. Author

Subject Categories:

  • Electrical and Electronic Equipment
  • Manufacturing and Industrial Engineering and Control of Production Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE