An Efficient Linear Ordering Algorithm for Netlist Partitioning
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.6 pp.1597-1602
- Publication Date
- 2001/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- VLSI Design Technology and CAD
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
