A Memory-Reinforced Tabu Search Algorithm With Critical Path Awareness for HW/SW Partitioning on Reconfigurable MPSoCs

Abstract

Hardware/software (HW/SW) partitioning and scheduling are the crucial steps in HW/SW co-design. They have a strong effect on performance, area, power and the system itself. In this paper, a memory-reinforced tabu search algorithm with critical path awareness (MTSP) is proposed for solving the HW/SW partitioning problem. First, the critical path (CP) algorithm can locate the critical task queues and output a reduced task graph. Second, the solution to a heuristic algorithm (HA) is used as the initial solution. Third, by introducing hash technology, adding dual memory tables improves the search strength and effectiveness of the tabu search, and the experiment is completed by priority scheduling. MTSP especially has good performance in large task graphs, while it can greatly improve system performance, especially in the case of generating a large communication penalty. The experimental results show that the average improvement over the latest efficient hybrid algorithm is up to 5%. The improvement in algorithm searching time is 66% in comparison to the popular algorithms cited in this paper. INDEX TERMS Hardware/software partitioning, task graph, heuristic method, tabu search algorithm, MPSoC.

Distributed massive UAV jamming optimization algorithm with artificial bee colony

“…However, the ABC algorithm easily falls into a local maximum and has poor robustness. Tabu search algorithm [29] was a deterministic local minimum jump strategy, which can effectively jump out of the local optimal situation. In [30], Yuan Feng combined tabu search algorithm and genetic algorithm, effectively improved the global search ability and found the optimal attack strategy.…”

A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem

“…In practice, the heuristic algorithms are used usually to solve the large scale NP-hard problems. For example, the tabu search algorithms are used to solve the spectrum frequency assignment problems [11], [30] and the hardware/software (HW/SW) partitioning problem [16], and the variable neighborhood search algorithm is applied to solve the energy consumption scheduling in blocking flow shops [32], etc.…”