Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning

نویسندگان

چکیده مقاله:

In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbalance. The algorithm is implemented to test real case study named RC6 block cipher circuit. The multi objective IPO algorithm (MOIPO) will give better results in comparison with the multi objective particle swarm optimization algorithm (MOPSO) with the same evaluation function.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IPO: An Inclined Planes System Optimization Algorithm

In the last decades, heuristic algorithms are widely used in solving problems in different fields of science and engineering. Most of these methods are inspired by natural phenomena, such as biological behaviours or physical principles.

متن کامل

Efficient FM Algorithm for VLSI Circuit Partitioning

In FM algorithm initial partitioning matrix of the given circuit is assigned randomly, as a result for larger circuit having hundred or more nodes will take long time to arrive at the final partition if the initial partitioning matrix is close to the final partitioning then the computation time (iteration) required is small . Here we have proposed novel approach to arrive at initial partitionin...

متن کامل

Multi-objective Optimization of Graph Partitioning using Genetic Algorithm

Graph partitioning is a NP-hard problem with multiple conflicting objectives. The graph partitioning should minimize the inter-partition relationship while maximizing the intra-partition relationship. Furthermore, the partition load should be evenly distributed over the respective partitions. Therefore this is a multiobjective optimization problem (MOO). One of the approaches to MOO is Pareto o...

متن کامل

A Genetic Algorithm Hardware Accelerator for VLSI Circuit Partitioning

In recent years there has been a great interest in accelerating time consuming algorithms that solve large combinatorial optimization problems [1]. The advent of high density field programmable gate arrays in combination with efficient synthesis tools have enabled the production of custom machines for such difficult problems. Genetic Algorithms (GAs) [13] are robust techniques based on natural ...

متن کامل

Evolutionary algorithms for VLSI multi-objective netlist partitioning

The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI has been a hot issue in recent years. In VLSI circuit partitioning, the problem of obtaining a minimum cut is of prime importance. With current trends, partitioning with multiple objectives which includes power, delay...

متن کامل

Multi-objective Particle Swarm Optimization Algorithm for Recommender System

This paper models the process of a recommender system as a multiobjective optimization problem, a discrete particle swarm optimization framework is established and has been integrated into multiobjective optimization, consequently, a multiobjective discrete particle swarm optimization algorithm is proposed to solve the modeled optimization problem. Each run of the current mainstream recommender...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 15  شماره 4

صفحات  137- 143

تاریخ انتشار 2019-02

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023