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
Dalam makalah ini, kami mencadangkan algoritma susunan linear yang cekap untuk pembahagian senarai bersih. Algoritma yang dicadangkan secara berperingkat menggabungkan dua segmen yang dipilih berdasarkan fungsi kos yang dicadangkan sehingga hanya satu segmen yang tinggal. Segmen terhasil akhir kemudiannya sepadan dengan susunan linear. Berbanding dengan kerja terdahulu, algoritma yang dicadangkan menghasilkan purata peningkatan 11.4% untuk pembahagian kos berskala sepuluh hala.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -