An Effective Heuristic-Based Approach for Partitioning
As being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/138037 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849410778720894976 |
|---|---|
| author | Xibin Zhao Hehua Zhang Yu Jiang Songzheng Song Xun Jiao Ming Gu |
| author_facet | Xibin Zhao Hehua Zhang Yu Jiang Songzheng Song Xun Jiao Ming Gu |
| author_sort | Xibin Zhao |
| collection | DOAJ |
| description | As being one of the most crucial steps in the design of
embedded systems, hardware/software partitioning has received
more concern than ever. The performance of a system design
will strongly depend on the efficiency of the partitioning. In
this paper, we construct a communication graph for embedded
system and describe the delay-related constraints and the
cost-related objective based on the graph structure. Then, we
propose a heuristic based on genetic algorithm and simulated
annealing to solve the problem near optimally. We note that the
genetic algorithm has a strong global search capability, while
the simulated annealing algorithm will fail in a local optimal
solution easily. Hence, we can incorporate simulated annealing
algorithm in genetic algorithm. The combined algorithm will
provide more accurate near-optimal solution with faster speed.
Experiment results show that the proposed algorithm produce
more accurate partitions than the original genetic algorithm. |
| format | Article |
| id | doaj-art-5a9e54cdc0ed48aa80ffb19945e12759 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-5a9e54cdc0ed48aa80ffb19945e127592025-08-20T03:34:58ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/138037138037An Effective Heuristic-Based Approach for PartitioningXibin Zhao0Hehua Zhang1Yu Jiang2Songzheng Song3Xun Jiao4Ming Gu5School of Software, Tsinghua University, TNLIST, KLISS, Beijing 100084, ChinaSchool of Software, Tsinghua University, TNLIST, KLISS, Beijing 100084, ChinaSchool of Software, Tsinghua University, TNLIST, KLISS, Beijing 100084, ChinaSchool for Integrative Sciences and Engineering, National Univerisity of Singapore, Kent, 119077, SingaporeInternational school, Beijing university of post and telecommunication, Beijing 100876, ChinaSchool of Software, Tsinghua University, TNLIST, KLISS, Beijing 100084, ChinaAs being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded system and describe the delay-related constraints and the cost-related objective based on the graph structure. Then, we propose a heuristic based on genetic algorithm and simulated annealing to solve the problem near optimally. We note that the genetic algorithm has a strong global search capability, while the simulated annealing algorithm will fail in a local optimal solution easily. Hence, we can incorporate simulated annealing algorithm in genetic algorithm. The combined algorithm will provide more accurate near-optimal solution with faster speed. Experiment results show that the proposed algorithm produce more accurate partitions than the original genetic algorithm.http://dx.doi.org/10.1155/2013/138037 |
| spellingShingle | Xibin Zhao Hehua Zhang Yu Jiang Songzheng Song Xun Jiao Ming Gu An Effective Heuristic-Based Approach for Partitioning Journal of Applied Mathematics |
| title | An Effective Heuristic-Based Approach for Partitioning |
| title_full | An Effective Heuristic-Based Approach for Partitioning |
| title_fullStr | An Effective Heuristic-Based Approach for Partitioning |
| title_full_unstemmed | An Effective Heuristic-Based Approach for Partitioning |
| title_short | An Effective Heuristic-Based Approach for Partitioning |
| title_sort | effective heuristic based approach for partitioning |
| url | http://dx.doi.org/10.1155/2013/138037 |
| work_keys_str_mv | AT xibinzhao aneffectiveheuristicbasedapproachforpartitioning AT hehuazhang aneffectiveheuristicbasedapproachforpartitioning AT yujiang aneffectiveheuristicbasedapproachforpartitioning AT songzhengsong aneffectiveheuristicbasedapproachforpartitioning AT xunjiao aneffectiveheuristicbasedapproachforpartitioning AT minggu aneffectiveheuristicbasedapproachforpartitioning AT xibinzhao effectiveheuristicbasedapproachforpartitioning AT hehuazhang effectiveheuristicbasedapproachforpartitioning AT yujiang effectiveheuristicbasedapproachforpartitioning AT songzhengsong effectiveheuristicbasedapproachforpartitioning AT xunjiao effectiveheuristicbasedapproachforpartitioning AT minggu effectiveheuristicbasedapproachforpartitioning |