By Topic

A fast multilayer general area router for MCM designs

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)
Kei-Yong Khoo ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; Cong, J.

The authors report on the development of an efficient multilayer general area router as an alternative to the three-dimensional (3-D) maze router for solving the multilayer multichip module (MCM) routing problem. The router, named SLICE, is independent of net ordering, requires much shorter computation time, and uses fewer vias. A key step in the router is to compute a maximum non-crossing bipartite matching, which is solved optimally in O(n log n) time where n is the number of possible connections. The router was tested on a number of examples, including two MCM designs. Compared to a 3-D maze router, SLICE is four times faster and uses 28% fewer vias. SLICE can successfully produce solutions for large MCM routing examples where 3-D maze routers fail due to insufficient memory

Published in:

Design Automation Conference, 1992., EURO-VHDL '92, EURO-DAC '92. European

Date of Conference:

7-10 Sep 1992