Conference Paper

A new genetic simulated annealing algorithm for hardware-software partitioning

DOI: 10.1109/ICISE.2010.5690308 Conference: Information Science and Engineering (ICISE), 2010 2nd International Conference on
Source: IEEE Xplore

ABSTRACT To solve the hardware/software partitioning problem in embedded system, this paper proposed a new genetic simulated annealing algorithm (NGSA) which based on analysis of genetic algorithms and simulated annealing algorithm the main advantages and disadvantages. The genetic algorithm integrates the simulated annealing idea; niche technology is introduced to maintain population diversity; and the Metropolis criterion with the formation of new groups to improve the quality of group. Experimental results show that the algorithm has strong climbing ability and global search capability, and the fitness value is significantly improved than genetic algorithm and simulated annealing algorithm.

0 Followers
 · 
119 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Hardware and Software co-design has become one of the main methodologies in modern embedded systems. The partitioning step, i.e. to decide which components of the system should be implemented in hardware and which ones in software, is the most important step in the embedded systems. Since the costs and delays of the final design strongly depend on partitioning results, there is a need to get an accurate estimate for hardware area, delay and power. However, accurate delay estimation methods are slow as they need a scheduling step. In this paper, we propose a reliable delay estimation method to be used within the partitioning step prior to the scheduling step.
    Circuits and Systems (MWSCAS), 2013 IEEE 56th International Midwest Symposium on; 01/2013