PSO: An Approach to Multiobjective VLSI Partitioning

被引:0
|
作者
Prakash, Atul [1 ]
Lal, R. K. [1 ]
机构
[1] Birla Inst Teclmol, Dept Elect & Commun Engn, Ranchi, Bihar, India
来源
2015 INTERNATIONAL CONFERENCE ON INNOVATIONS IN INFORMATION, EMBEDDED AND COMMUNICATION SYSTEMS (ICIIECS) | 2015年
关键词
PSO; Cutsize; Sleep time; NP-hard;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper multiobjective optimization problem simultaneously optimized using PSO algorithm has been attempted. The methodology used in this paper is based upon the information sharing and movement of swarms or particles in a search space. Multiobjective optimization problems are present at physical design level at partitioning process of VLSI circuit optimization. Here present the results of multiobjective optimization of cutsize, delay and sleep time simultaneously using swarm technique (PSO). Results in this paper shows that the NP hard problem effectively solved by PSO algorithm. Here set up the problem as a simultaneously multiobjective optimization and solve it by programming method. Information of the circuit has been given in accordance with circuit netlist files used in ISPD'98 circuit benchmark suite. The proposed approach has a good potential in VLSI circuit partitioning.
引用
收藏
页数:7
相关论文
共 50 条
  • [31] SimE/TS fuzzy hybrid for multiobjective VLSI placement
    Sait, SM
    Kinhas, MR
    ELECTRONICS LETTERS, 2006, 42 (06) : 364 - 365
  • [32] Genetic VLSI circuit partitioning with dynamic embedding
    Moon, BR
    Kim, CK
    FIRST INTERNATIONAL CONFERENCE ON KNOWLEDGE-BASED INTELLIGENT ELECTRONIC SYSTEMS, PROCEEDINGS 1997 - KES '97, VOLS 1 AND 2, 1997, : 461 - 469
  • [33] Recursive and flat partitioning for VLSI circuit design
    Areibi, S
    ICM 2001: 13TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS, PROCEEDINGS, 2001, : 237 - 240
  • [34] Benchmarking Open Access VLSI Partitioning Tools
    Oliveira, Isadora
    Danigno, Marcelo
    Butzen, Paulo F.
    Reis, Ricardo
    2021 IEEE 12TH LATIN AMERICA SYMPOSIUM ON CIRCUITS AND SYSTEM (LASCAS), 2021,
  • [35] Adaptive genetic algorithm for VLSI circuit partitioning
    Democritus Univ of Thrace, Xanthi, Greece
    Int J Electron, 2 (205-214):
  • [36] Optimum partitioning problem for rectilinear VLSI layout
    Ku, LP
    Leong, HW
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1997, 144 (03): : 155 - 162
  • [37] Multilevel hypergraph partitioning: Applications in VLSI domain
    Karypis, G
    Aggarwal, R
    Kumar, V
    Shekhar, S
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 1999, 7 (01) : 69 - 79
  • [38] Hierarchical strategy of model partitioning for VLSI-design using an improved mixture of experts approach
    Hering, K
    Haupt, R
    Villmann, T
    TENTH WORKSHOP ON PARALLEL AND DISTRIBUTED SIMULATION - PADS 96, PROCEEDINGS, 1996, : 106 - 113
  • [39] A Discrete FireFly Algorithm for VLSI Circuit Partitioning
    Sharma, Pradip Kumar
    Kaur, Maninder
    2014 INTERNATIONAL CONFERENCE ON ELECTRONICS AND COMMUNICATION SYSTEMS (ICECS), 2014,
  • [40] Statistical timing driven partitioning for VLSI circuits
    Ababei, C
    Bazargan, K
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, 2002 PROCEEDINGS, 2002, : 1109 - 1109