An efficient linear ordering algorithm for netlist partitioning

被引：0
|
作者：
Seong, KS [1 ]
机构：
[1] Yeungnam Univ, Sch Elect Engn & Comp Sci, Kyongsan 712749, Kyongbuk, South Korea
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2001年 / E84A卷 / 06期
关键词：
netlist partitioning; spectral method; linear ordering;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：1597 / 1602
页数：6
相关论文
共 50 条
  • [21] A CUTTING PLANE ALGORITHM FOR THE LINEAR ORDERING PROBLEM
    GROTSCHEL, M
    JUNGER, M
    REINELT, G
    OPERATIONS RESEARCH, 1984, 32 (06) : 1195 - 1220
  • [22] A partitioning algorithm for solving systems of linear equations
    Int J Math Educ Sci Technol, 5 (641):
  • [23] A partitioning and bounded variable algorithm for linear programming
    Sheskin, Theodore J.
    INTERNATIONAL JOURNAL OF MATHEMATICAL EDUCATION IN SCIENCE AND TECHNOLOGY, 2006, 37 (04) : 433 - 442
  • [24] An Efficient Net Ordering Algorithm for Buffer Insertion
    Kheirabadi, Hamid Reza
    Zamani, Morteza Saheb
    GLSVLSI'07: PROCEEDINGS OF THE 2007 ACM GREAT LAKES SYMPOSIUM ON VLSI, 2007, : 521 - 524
  • [25] Design and implementation of an efficient thread partitioning algorithm
    Amaral, JN
    Gao, G
    Kocalar, ED
    O'Neill, P
    Tang, XN
    HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 2000, 1940 : 252 - 259
  • [26] An efficient memetic algorithm for the graph partitioning problem
    Philippe Galinier
    Zied Boujbel
    Michael Coutinho Fernandes
    Annals of Operations Research, 2011, 191 : 1 - 22
  • [27] Minimizing Scrubbing Effort through Automatic Netlist Partitioning and Floorplanning
    Schmidt, Bernhard
    Ziener, Daniel
    Teich, Juergen
    PROCEEDINGS OF 2014 IEEE INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2014, : 299 - 304
  • [28] An efficient memetic algorithm for the graph partitioning problem
    Galinier, Philippe
    Boujbel, Zied
    Fernandes, Michael Coutinho
    ANNALS OF OPERATIONS RESEARCH, 2011, 191 (01) : 1 - 22
  • [29] RLDRPSO: An Efficient Heuristic Algorithm for Task Partitioning
    Qi, Xiaofeng
    Zhang, Xingming
    Yuan, Kaijian
    ADVANCED COMPUTER ARCHITECTURE, ACA 2016, 2016, 626 : 118 - 129
  • [30] An efficient clustering algorithm for partitioning parallel programs
    Maheshwari, P
    Shen, H
    PARALLEL COMPUTING, 1998, 24 (5-6) : 893 - 909
12345