Maximum Terminal Interconnection by a Given Length using Rectilinear Edge

• Published in: Journal of Information and Communication Convergence Engineering, 19(2) Vol. 19; no. 2; pp. 114 - 119
• Main Authors: Byungyeon Hwang, Hanna Kim, Yeonsoo Kim, Minkwon Kim
• Format: Journal Article
• Language: English
• Published: 한국정보통신학회JICCE 2021; 한국정보통신학회
• Subjects: 전자/정보통신공학; NP-hardness; Genetic algorithm; Rectilinear steiner tree; Interconnection graph problem
• ISSN: 2234-8255; 2234-8883
• DOI: 10.6109/jicce.2021.19.2.114

This paper proposes a method to find an optimal T' with the most terminal of the subset of T' trees that can be connected by a given length by improving a memetic genetic algorithm within several constraints, when the set of terminal T is given to the Euclidean plane R2. Constraint (1) is that a given length cannot connect all terminals of T, and (2) considers only the rectilinear layout of the edge connecting each terminal. The construction of interconnections has been used in various design-related areas, from network to architecture. Among these areas, there are cases where only the rectilinear layout is considered, such as wiring paths in the computer network and VLSI design, network design, and circuit connection length estimation in standard cell deployment. Therefore, the heuristics proposed in this paper are expected to provide various cost savings in the rectilinear layout. KCI Citation Count: 0