Method, apparatus, and device, and storage medium for scheduling instruction

A device for scheduling an instruction, comprising:

• an input/output interface, one or more processors, and a memory containing a computer program that, when being executed, causes the one or more processors to perform:
• acquiring a first instruction sequence and scheduling information, the first instruction sequence comprising N instructions, the scheduling information being a scheduling parameter required for performing a scheduling operation on the N instructions, and N being a positive integer;
• performing breadth search processing on the scheduling information and first M instructions among the N instructions based on a breadth search algorithm, to obtain L sub-scheduling sets, each sub-scheduling set comprising scheduling results of the first M instructions, L being a positive integer, and 1≤M<N;
• performing backtracking search processing in parallel on the scheduling information and remaining N-M instructions among the N instructions based on a backtracking search algorithm through L first threads in the L sub-scheduling sets, to obtain target scheduling results of the N instructions, the sub-scheduling sets corresponding one-to-one to the first threads;
• and
• generating a target code program based on the target scheduling results, the target code program being configured for scheduling the instructions.

A non-transitory computer-readable storage medium containing a computer program that, when being executed, causes at least one processor of a computer device to perform:

• acquiring a first instruction sequence and scheduling information, the first instruction sequence comprising N instructions, the scheduling information being a scheduling parameter required for performing a scheduling operation on the N instructions, and N being a positive integer;
• performing breadth search processing on the scheduling information and first M instructions among the N instructions based on a breadth search algorithm, to obtain L sub-scheduling sets, each sub-scheduling set comprising scheduling results of the first M instructions, L being a positive integer, and 1≤M<N;
• performing backtracking search processing in parallel on the scheduling information and remaining N-M instructions among the N instructions based on a backtracking search algorithm through L first threads in the L sub-scheduling sets, to obtain target scheduling results of the N instructions, the sub-scheduling sets corresponding one-to-one to the first threads;
• and
• generating a target code program based on the target scheduling results, the target code program being configured for scheduling the instructions.