A force-directed maze router

F. Mo; A. Tabbara; R.K. Brayton; IEEE

doi:10.1109/ICCAD.2001.968658

Back

Conference proceeding

A force-directed maze router

F. Mo, A. Tabbara, R.K. Brayton and IEEE

IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281), pp.404-407

2001

DOI: https://doi.org/10.1109/ICCAD.2001.968658

Abstract

Algorithm design and analysis

Clocks

Design automation

Integrated circuit technology

Power system reliability

Routing

Shape

System-on-a-chip

Topology

Wires

A new routing algorithm is presented. It is based on a multiple star net model, force-directed placement and maze searching techniques. The algorithm inherits the power of maze routing in that it is able to route complex layouts with various obstructions. The large memory requirement of the conventional maze algorithm is alleviated through successive net refinement, which constrains the maze searching to small regions. The algorithm shows advantages in routing designs with complicated layout obstructions.

Metrics

1 Record Views

Details

Title: A force-directed maze router
Creators - without role: F. Mo - Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
A. Tabbara
R.K. Brayton
IEEE
Publication Details: IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281), pp.404-407
Publisher: IEEE
Identifiers: 9925272108331
Academic Unit: Prince Mohammad Bin Fahd University
Language: English
Resource Type: Conference proceeding