An O(NlogN) Algorithm for Region Definition Using Channels/Switchboxes and Ordering Assignment | Zendy

Jin-Tai Yan | Zendy; PeiYung Hsiao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An O(NlogN) Algorithm for Region Definition Using Channels/Switchboxes and Ordering Assignment

Author(s) -

Jin-Tai Yan,

PeiYung Hsiao

Publication year - 1994

Publication title -

vlsi design

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.123

H-Index - 24

eISSN - 1065-514X

pISSN - 1026-7123

DOI - 10.1155/1996/36403

Subject(s) - routing (electronic design automation) , computer science , algorithm , channel (broadcasting) , routing algorithm , destination sequenced distance vector routing , multipath routing , equal cost multi path routing , block (permutation group theory) , link state routing protocol , mathematics , combinatorics , routing protocol , computer network

For a building block placement, the routing space can be further partitioned into channels and switchboxes. In general, the definition of switchboxes releases the cyclic channel precedence constraints and further yields a safe routing ordering process. However, switchbox routing is more difficult than channel routing. In this paper, an O(NlogN) region definition and ordering assignment (RDAOA) algorithm is proposed to minimize the number of switchboxes for the routing phase, where N is the number of vertices in a channel precedence graph. Several examples have been tested on the proposed algorithm, and the experimental results are listed and compared

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research