The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 넷리스트 분할을 위한 효율적인 선형 정렬 알고리즘을 제안합니다. 제안하는 알고리즘은 제안된 비용 함수에 따라 선택된 두 개의 세그먼트를 하나의 세그먼트만 남을 때까지 점진적으로 병합합니다. 최종 결과 세그먼트는 선형 순서에 해당합니다. 제안된 알고리즘은 이전 연구와 비교하여 11.4방향 규모의 비용 분할에 대해 평균 XNUMX%의 개선을 가져왔습니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kwang-Su SEONG, "An Efficient Linear Ordering Algorithm for Netlist Partitioning" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 6, pp. 1597-1602, June 2001, doi: .
Abstract: In this paper, we propose an efficient linear ordering algorithm for netlist partitioning. The proposed algorithm incrementally merges two segments which are selected based on the proposed cost function until only one segment remains. The final resultant segment then corresponds to the linear order. Compared to the earlier work, the proposed algorithm yields an average of 11.4% improvement for the ten-way scaled cost partitioning.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_6_1597/_p
부
@ARTICLE{e84-a_6_1597,
author={Kwang-Su SEONG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Linear Ordering Algorithm for Netlist Partitioning},
year={2001},
volume={E84-A},
number={6},
pages={1597-1602},
abstract={In this paper, we propose an efficient linear ordering algorithm for netlist partitioning. The proposed algorithm incrementally merges two segments which are selected based on the proposed cost function until only one segment remains. The final resultant segment then corresponds to the linear order. Compared to the earlier work, the proposed algorithm yields an average of 11.4% improvement for the ten-way scaled cost partitioning.},
keywords={},
doi={},
ISSN={},
month={June},}
부
TY - JOUR
TI - An Efficient Linear Ordering Algorithm for Netlist Partitioning
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1597
EP - 1602
AU - Kwang-Su SEONG
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2001
AB - In this paper, we propose an efficient linear ordering algorithm for netlist partitioning. The proposed algorithm incrementally merges two segments which are selected based on the proposed cost function until only one segment remains. The final resultant segment then corresponds to the linear order. Compared to the earlier work, the proposed algorithm yields an average of 11.4% improvement for the ten-way scaled cost partitioning.
ER -