Nandy, SK and Deogaonkar, Anuradha and Moona, Rajat and Madhuri, Sudha C (1990) K-d tree based gridless maze routing on message passing multiprocessor systems. In: Journal of the Institution of Electronics and Telecommunication Engineers, 36 (4). pp. 287-293.Full text not available from this repository. (Request a copy)
The routing of nets or a set of interconnection points is a complete intensive application encountered in CAD for VLSI design. This paper proposes a gridless algorithm for area routing based on the Hightower's Maze routing algorithm for message passing multiprocessor systems. The suitability of k-d trees as a data structuring technique for gridless maze routing is established. Since segments of routes are stored as rectangular objects in the k-d tree, the algorithm facilitates routing with variable width conductor paths. Results obtained both through simulation techniques and those obtained on an actual multiprocessor system based on message passing exhibit speedup proportional to the number of processors in the multiprocessor system.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to The Institution of Electronics and Telecommunication Engineers (IETE).|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||28 Feb 2008|
|Last Modified:||27 Aug 2008 13:10|
Actions (login required)