By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Date, H. ; Inst. for New Generation Comput. Technol., Tokyo, Japan ; Taki, K.

A 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 rotating 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

Published in:

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Date of Conference:

22-25 Feb 1993