Critical Path and Efficient Particle Swarm Algorithm for Hardware/Software Partitioning

Hardware/Software partitioning is the problem of which functional modules of system are implemented on hardware and which ones on software to make the system achieve optimal performance under system constraints.In this paper,a directed acyclic graph on the division of modeling,we proposed critical path scheduling,adaptive and efficient particle swarm algorithm for hardware/software partitioning.Experimental results show that the algorithms proposed in the paper can produce better solution than first-come first-served scheduling.