A parallel lookahead line search router with automaticripup-and-reroute

摘要

A parallel routing method is proposed and evaluated. A key featurenis object-oriented modeling. All line segments are modeled asnindependent objects communicating with each other through messagenexchanges. A distributed routing algorithm is designed based on anlookahead line search method that includes automatic ripup-and-reroutento retain the rotating order. The program was implemented in anconcurrent logic language, KL1, and was executed on PIM/m (ParallelnInference Machine), a distributed memory machine with 256 processors.nThe evaluation results for several industrial data are given