z-logo
open-access-imgOpen Access
CHiRPS: a general-area parallel multilayer routing system
Author(s) -
R. Venkateswaran,
Pinaki Mazumder
Publication year - 1995
Publication title -
iee proceedings - computers and digital techniques
Language(s) - English
Resource type - Journals
eISSN - 1359-7027
pISSN - 1350-2387
DOI - 10.1049/ip-cdt:19951619
Subject(s) - computer science , pathfinder , parallel computing , routing (electronic design automation) , massively parallel , distributed computing , grid , graph , reduction (mathematics) , modular design , algorithm , theoretical computer science , computer network , mathematics , geometry , library science , operating system
A new, highly parallel model for concurrent multilayer routing, called CHiRPS (Configurable Highly Routable Parallel System), is presented. The nucleus of CHiRPS is a very flexible pathfinder that can be easily configured, even in the presence of obstacles, to generate various commonly used pattern-based routes, such as Steiner trees with single trunk, comb trees, contour-based routes, etc., that span multiple layers simultaneously. The authors employ the concept of a total grid-graph to capture the state of the routing region. The main steps of the pathfinder are based on new parallel algorithms for cycle detection, cycle elimination and tree reduction. The proposed algorithms scale well with increased problem sizes since they require only O(log N) time when given a grid-graph with up to N2 nodes. As such, they are good candidates for massively data-parallel machines

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom