Results 1 
6 of
6
Hardware Software Partitioning Problem in Embedded System Design Using Particle Swarm Optimization Algorithm
"... Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimization (PSO) algorithm. Performance analysis of the proposed scheme with Integer Linear Programming, Genetic Algorithm and ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimization (PSO) algorithm. Performance analysis of the proposed scheme with Integer Linear Programming, Genetic Algorithm and Ant Colony Optimization technique has been compared using standard benchmark datasets, and the computer simulations reveal that the proposed approach outperforms all the metaheuristic based existing techniques with respect to cumulative runtimes for several runs of the same program. The Integer Linear Programming has been found to yield the optimal solutions, and the proposed swarm scheme yields suboptimal solution, sufficiently close to the reported results obtained for integer programming.
Improvements of the GCLP Algorithm for HW/SW Partitioning of Task Graphs
 in Proc. of the 4th IASTED Int. Conf. on Circuits, Signals, and Systems (CSS
, 2006
"... HW/SW partitioning of modern heterogeneous systems, which combine signal processing as well as multimedia applications, is usually performed on a task or process graph representation. As this optimisation problem is known to be NPhard, existing partitioning techniques rely on heuristic methods to t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
HW/SW partitioning of modern heterogeneous systems, which combine signal processing as well as multimedia applications, is usually performed on a task or process graph representation. As this optimisation problem is known to be NPhard, existing partitioning techniques rely on heuristic methods to traverse the vast search space. The Global Criticality/Local Phase (GCLP) algorithm, initially introduced by Kalavade and Lee as an integral part of the Ptolemy work suite, has been frequently referred to as fast and powerful technique to generate high quality solutions for a combined partitioning/scheduling problem. In this work the internal mechanisms of the GCLP algorithm have been thoroughly analysed and several modifications are proposed that lead either to a significant increase of the quality of the obtained solutions without affecting the computation time of the algorithm or to a substantially lower computation time while increasing the output of valid partitioning solutions.
Finding optimal hardware/software partitions
 FORMAL METHODS IN SYSTEM DESIGN
, 2007
"... Most previous approaches to hardware/software partitioning considered heuristic solutions. In contrast, this paper presents an exact algorithm for the problem based on branchandbound. Several techniques are investigated to speed up the algorithm, including bounds based on linear programming, a cus ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Most previous approaches to hardware/software partitioning considered heuristic solutions. In contrast, this paper presents an exact algorithm for the problem based on branchandbound. Several techniques are investigated to speed up the algorithm, including bounds based on linear programming, a custom inference engine to make the most out of the inferred information, advanced necessary conditions for partial solutions, and different heuristics to obtain highquality initial solutions. It is demonstrated with empirical measurements that the resulting algorithm can solve highly complex partitioning problems in reasonable time. Moreover, it is about ten times faster than a previous exact algorithm based on integer linear programming. The presented methods can also be useful in other related optimization problems.
A Fast Rescheduling Heuristic of SDF Graphs for HW/SW Partitioning Algorithms
"... HW/SW partitioning of modern heterogeneous systems, which combine signal processing as well as multimedia applications, is usually performed on a task or process graph representation. As this optimisation problem is known to be NPhard, existing partitioning techniques rely on heuristic methods to t ..."
Abstract
 Add to MetaCart
(Show Context)
HW/SW partitioning of modern heterogeneous systems, which combine signal processing as well as multimedia applications, is usually performed on a task or process graph representation. As this optimisation problem is known to be NPhard, existing partitioning techniques rely on heuristic methods to traverse the vast search space. Moreover the process scheduling of a synchronous data flow (SDF) graph on distributed resources, which constitutes the evaluation of every single partitioning solution, is also an NPhard problem. This paper proposes a fast rescheduling technique of SDF graphs suitable for HW/SW partitioning algorithms that move incrementally through the search space. Its performance is demonstrated by a comparison to classical list scheduling algorithms for distributed resources.
EXTENDING THE GCLP ALGORITHM FOR HW/SW PARTITIONING: A DETAILED PLATFORM MODEL AND PERFORMANCE IMPROVEMENTS
"... HW/SW partitioning of modern heterogeneous systems, which combine signal processing as well as multimedia applications, is usually performed on a task or process graph representation. As this optimisation problem is known to be NPhard, existing partitioning techniques rely on heuristic methods to ..."
Abstract
 Add to MetaCart
(Show Context)
HW/SW partitioning of modern heterogeneous systems, which combine signal processing as well as multimedia applications, is usually performed on a task or process graph representation. As this optimisation problem is known to be NPhard, existing partitioning techniques rely on heuristic methods to traverse the vast search space. The Global Criticality/Local Phase (GCLP) algorithm, initially introduced by Kalavade and Lee as an integral part of the Ptolemy work suite, has been frequently referred to as fast and powerful technique to generate high quality solutions for a combined partitioning/scheduling problem. Although having a good reputation, GCLP neglects essential information with respect to the underlying communication model. A detailed communication model for a typical SystemOnChip (SoC) architecture is introduced that considers different read and write times for all memory and bus resources. The internal mechanisms of the GCLP algorithm have been thoroughly analysed and several modifications are proposed that lead either to a significant increase of the quality of the obtained solutions without affecting the computation time of the algorithm or to a substantially lower computation time while increasing the output of valid partitioning solutions.