An Efficient Linear Ordering Algorithm for Netlist Partitioning

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2001-06-01

著者

• Seong Kwang-su

  School Of Electrical Engineering And Computer Science Yeungnam University

関連論文

• An Efficient Linear Ordering Algorithm for Netlist Partitioning

スポンサーリンク