NDLI: <formula formulatype=inline><tex>$lambda$</tex></formula>-OAT: <formula formulatype=inline><tex>$lambda$</tex></formula>-Geometry Obstacle-Avoiding Tree Construction With <formula formulatype=inline><tex>$O(nlog n)$</tex></formula> Complexity

Content Provider	IEEE Xplore Digital Library
Author	Tom Tong Jing Zhe Feng Yu Hu Hong, X.L. Hu, X.D. Yan, G.Y.
Copyright Year	1982
Abstract	Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is an essential part of routing. Recently, IC routing and related researches have been extended from Manhattan architecture (lambda₂-geometry) to Y-/X-architecture (lambda₃-lambda₄-geometry) to improve the chip performance. This paper presents an O(n log n) heuristic, lambda-OAT, for obstacle-avoiding Steiner minimal tree construction in the lambda-geometry plane (lambda-OASMT). In this paper, based on obstacle-avoiding constrained Delaunay triangulation, a full connected tree is constructed and then embedded into lambda-OASMT by zonal combination. To the best of our knowledge, this is the first work addressing the lambda-OASMT problem. Compared with most recent works on OARSMT problem, lambda-OAT obtains up to 30-Kx speedup with quality solution. We have tested randomly generated cases with up to 10 K terminals and 10-K rectilinear obstacles within 4 seconds on a Sun V880 workstation (755-MHz CPU and 4-GB memory). The high efficiency and accuracy of lambda-OAT make it extremely practical and useful in the routing phase.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	2073
Ending Page	2079
Page Count	7
File Size	430287
File Format	PDF
ISSN	02780070
Volume Number	26
Issue Number	11
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-11-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Steiner trees Very large scale integration Wire Computer science education Educational programs Computer science Large-scale systems Testing Sun very large scale integration (VLSI) Physical design routing Steiner tree
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm

Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm

Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

Spanning graph-based nonrectilinear steiner tree algorithms

ObSteiner: An Exact Algorithm for the Construction of Rectilinear Steiner Minimum Trees in the Presence of Complex Rectilinear Obstacles

On the Construction of Optimal Obstacle-Avoiding Rectilinear Steiner Minimum Trees

Efficient Steiner tree construction based on spanning graphs

Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem

$lambda$-OAT: $lambda$-Geometry Obstacle-Avoiding Tree Construction With $O(nlog n)$ Complexity

Similar Documents

EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm

Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm

Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

Spanning graph-based nonrectilinear steiner tree algorithms

ObSteiner: An Exact Algorithm for the Construction of Rectilinear Steiner Minimum Trees in the Presence of Complex Rectilinear Obstacles

On the Construction of Optimal Obstacle-Avoiding Rectilinear Steiner Minimum Trees

Efficient Steiner tree construction based on spanning graphs

Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem

$lambda$-OAT: $lambda$-Geometry Obstacle-Avoiding Tree Construction With $O(nlog n)$ Complexity