Novel efficient heuristic-type two-stage parallel branch-and-bound method

Abstract

The invention discloses a heuristic-type two-stage parallel branch-and-bound method which comprises a local search stage, a global search stage and a final output stage, wherein at the local search stage, a local optimized solution is obtained quickly by a coarse granularity manner through local heuristic search; at the global search stage, an optimal solution is found in small sub-space through mutual information sharing between parallel programs; and at the final output stage, an optimal dispatch sequence is output after an arbitrary search task obtains an optimal dispatch sequence or after all the search tasks complete searching. The method disclosed by the invention has the advantages that the optimal solution of distribution and dispatch of workflow resources under resource constraint conditions can be obtained efficiently; the problems in a traditional branch-and-bound method that initial solution space is too large and excessive time is consumed can be avoided; and because of efficient cooperative work between the parallel programs, the time consumed by the whole solution course can be greatly reduced.

Description

technical field [0001] The invention belongs to the field of computers, focuses on resource constrained scheduling (RCS) optimization in high-level synthesis, and in particular relates to a novel and efficient heuristic two-stage parallel branch-and-bound method. Background technique [0002] Traditional branch and bound methods (such as BULB) are mostly designed to find an approximate optimal solution, using the following techniques: [0003] High-level synthesis (High-level Synthesis, abbreviated as HLS): also known as advanced synthesis, C synthesis (Csynthesis), electronic system level synthesis (Electronic System Level synthesis, abbreviated as ESLsynthesis), is to describe the algorithm level or behavior level of the circuit design specification in The method and process of transforming into circuit structure description under certain constraints. High-level synthesis is also called behavior-level synthesis, algorithm-level synthesis, etc. It enables designers to con...

AI Technical Summary

Problems solved by technology

[0007] Under resource constraints, the traditional branch-and-bound method has the following disadvantages: with the increase of the DFD graph, the time required by the traditional branch-and-bound method will increase rapidly; many improved branch-and-bound methods use To find an approximate optimal solution, not the real optimal solution; most branch and bound methods only consider solving through a single task; at the same time, these methods never consider the optimization problem of the initial solution space

Images