scispace - formally typeset

Book ChapterDOI

Performance Driven Routing in Distributed Environment

28 Dec 2002-Lecture Notes in Computer Science (Springer, Berlin, Heidelberg)-Vol. 2571, pp 257-267

AbstractAs fabrication technology advances, devices and interconnection wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Work on routing channels with reduced crosstalk is a very important area of current research [3, 10]. We know that the crosstalk minimization problem in the reserved two-layer Manhattan routing model is NP-complete, even for the channels without any vertical constraints. Since minimizing crosstalk is NP-complete, several polynomial time heuristic algorithms for reducing crosstalk have been developed [8, 9, 15]. All the ideas that are introduced as heuristics are basically sequential in nature. In this paper we have developed two efficient heuristics to compute reduced crosstalk routing solutions in a distributed computing environment. Our proposed heuristics are much better in computational complexity than the existing sequential versions of the algorithms developed in [9, 15].

...read more


References
More filters
Proceedings ArticleDOI
30 Apr 1968
TL;DR: To achieve high throughput rates today's computers perform several operations simultaneously; not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently.
Abstract: To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently. A major problem in the design of such a computing system is the connecting together of the various parts of the system (the I/O devices, memories, processing units, etc.) in such a way that all the required data transfers can be accommodated. One common scheme is a high-speed bus which is time-shared by the various parts; speed of available hardware limits this scheme. Another scheme is a cross-bar switch or matrix; limiting factors here are the amount of hardware (an m × n matrix requires m × n cross-points) and the fan-in and fan-out of the hardware.

2,424 citations

Book
01 Dec 1992
TL;DR: This book deals with advanced computer architecture and parallel programming techniques and is suitable for use as a textbook in a one-semester graduate or senior course, offered by Computer Science, Computer Engineering, Electrical Engineering, or Industrial Engineering programs.
Abstract: From the Publisher: This book deals with advanced computer architecture and parallel programming techniques. The material is suitable for use as a textbook in a one-semester graduate or senior course,offered by Computer Science,Computer Engineering,Electrical Engineering,or Industrial Engineering programs.

822 citations

Proceedings ArticleDOI
28 Jun 1971
TL;DR: The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards based on the newly developed channel assignment algorithm and requires many via holes.
Abstract: The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards. This technique has been developed at the University of Illinois Center for Advanced Computation and has been programmed in ALGOL for a B5500 computer. The routing method is based on the newly developed channel assignment algorithm and requires many via holes. The primary goals of the method are short execution time and high wireability. Actual design specifications for ILLIAC IV Control Unit boards have been used to test the feasibility of the routing technique. Tests have shown that this algorithm is very fast and can handle large boards.

650 citations

Journal ArticleDOI
TL;DR: Two new algorithms merge nets instead of assigning horizontal tracks to individual nets to route a specified net list between two rows of terminals across a two-layer channel in the layout design of LSI chips.
Abstract: In the layout design of LSI chips, channel routing is one of the key problems. The problem is to route a specified net list between two rows of terminals across a two-layer channel. Nets are routed with horizontal segments on one layer and vertical segments on the other. Connections between two layers are made through via holes. Two new algorithms are proposed. These algorithms merge nets instead of assigning horizontal tracks to individual nets. The algorithms were coded in Fortran and implemented on a VAX 11/780 computer. Experimental results are quite encouraging. Both programs generated optimal solutions in 6 out of 8 cases, using examples in previously published papers. The computation times of the algorithms for a typical channel (300 terminals, 70 nets) are 1.0 and 2.1 s, respectively.

538 citations

Book
01 Mar 1994
TL;DR: Graph theoretic terminology review of complex numbers parallel algorithm design strategies and how to design parallel algorithms for linear systems and multiprocessors.
Abstract: PRAM algorithms processor arrays, multiprocessors and multicomputers parallel programming languages mapping and scheduling elementary parallel algorithms matrix multiplication the fast Fourier transform solving linear systems sorting dictionary operations graph algorithms combinational search. Appendices: graph theoretic terminology review of complex numbers parallel algorithm design strategies.

471 citations