A parallel lookahead line search router with automatic ripup-and-reroute:

Abstract: "In this paper, a new parallel routing method is proposed and evaluated. A key feature is object-oriented modeling. All line segments are modeled as independent objects communicating with each other through message exchanges. A distributed routing algorithm is designed based on a look...

Full description

Saved in:
Bibliographic Details
Main Authors: Date, Hiroshi (Author), Taki, Kazuo (Author)
Format: Book
Language:English
Published: Tokyo, Japan 1992
Series:Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 819
Subjects:
Summary:Abstract: "In this paper, a new parallel routing method is proposed and evaluated. A key feature is object-oriented modeling. All line segments are modeled as independent objects communicating with each other through message exchanges. A distributed routing algorithm is designed based on a lookahead line search method that includes automatic ripup-and-reroute to retain the routing order. The program was implemented in a concurrent logic language, KL1, and was executed on PIM/m (Parallel Inference Machine), a distributed memory machine with 256 processors. The evaluation results for several industrial data are given."
Physical Description:5 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!