Algorithmic aspects of hardware/software partitioning
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Low-complex dynamic programming algorithm for hardware/software partitioning
Information Processing Letters
Algorithmic aspects of area-efficient hardware/software partitioning
The Journal of Supercomputing
Finding optimal hardware/software partitions
Formal Methods in System Design
Algorithmic aspects for power-efficient hardware/software partitioning
Mathematics and Computers in Simulation
New model and algorithm for hardware/software partitioning
Journal of Computer Science and Technology
Integrating Time and Resource into Circus
Electronic Notes in Theoretical Computer Science (ENTCS)
Low-complex dynamic programming algorithm for hardware/software partitioning
Information Processing Letters
Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning
International Journal of Applied Mathematics and Computer Science
A hybrid heuristic algorithm for HW-SW partitioning within timed automata
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Minimizing power in hardware/software partitioning
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Efficient heuristic algorithms for path-based hardware/software partitioning
Mathematical and Computer Modelling: An International Journal
Efficient heuristic and tabu search for hardware/software partitioning
The Journal of Supercomputing
Hi-index | 0.00 |
In this paper, we present a hierarchical evolutionary approach to hardware/software partitioning for real-time embedded systems. In contrast to most of previous approaches, we apply a hierarchical structure and dynamically determine the granularity of tasks and hardware modules to adaptively optimize the solution while keeping the search space as small as possible. Two new search operators are described, which exploit the proposed hierarchical structure.Efficient ranking is another problem addressed in this paper. Imprecisely Specified Multiple Attribute Utility Theory has the advantage of constraining the solution space based on the designer's preference, but suffers from high computation overhead. We propose a new technique to reduce the overhead. Experiment results show that our algorithm is both effective and efficient.