Author
Arpan Singha
Bio: Arpan Singha is an academic researcher from University of Calcutta. The author has contributed to research in topics: Heuristics & Routing (electronic design automation). The author has co-authored 1 publications.
Papers
More filters
TL;DR: In this article, the authors proposed two efficient heuristics to compute reduced crosstalk routing solutions in a distributed computing environment, which are much better in computational complexity than the existing sequential versions of the algorithms developed in [9, 15].
Abstract: As 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].