Task uploading method and device based on satellite single task instruction capacity, electronic equipment and storage medium

Abstract

The invention discloses a task annotation method based on satellite single task instruction capacity. The task annotation method comprises the following steps: judging whether the number of instructions of an ith to-be-annotated task is greater than an instruction capacity threshold value or not; if not, whether the cache list is empty or not is judged, and if not, the instruction capacity quasi-remaining amount of the cache list is calculated; when the quasi residual amount of the instruction capacity is greater than or equal to the number of the instructions of the i-th to-be-annotated task, adding the i-th to-be-annotated task into a cache list; if yes, a quasi upper injection arc section is determined in the available upper injection arc sections; calculating an instruction capacity quasi-completion residual amount of the cache list; and when the instruction capacity quasi-completion residual amount is greater than or equal to the instruction number of the i-th task to be annotated, adding the i-th task to be annotated into the cache list. According to the method, the instruction task uploading efficiency and execution efficiency are greatly improved. The invention further discloses a device for implementing the method, electronic equipment and a computer readable storage medium.

Description

Technical Field

[0001] The present invention relates to the field of satellite data processing technology, and in particular to a task injection method, device, electronic equipment and storage medium based on satellite single-task instruction capacity. Background Art

[0002] Instruction capacity refers to the number of instructions that a spacecraft can store and execute. Instruction capacity is an important parameter in the design and operation of a spacecraft, which determines the complexity of the tasks and the number of operations that the spacecraft can perform. Instruction capacity is mainly used in the field of aerospace science and technology, especially in the design and operation of spacecraft such as satellites and rockets. It reflects the number of instructions that a spacecraft can store and execute, and has a vital impact on the mission execution and performance of the spacecraft. The instruction capacity of a small satellite is the instruction capacity that is released one by one after the task execution is completed. In the existing technology, all instruction tasks are loaded at once. Under the limited instruction capacity, the instruction tasks are executed sequentially, the resource utilization rate is low, and the loading and execution efficiency is low. Summary of the invention

[0003] In order to solve the above problems existing in the prior art, the present invention provides a task injection method, device, electronic device and storage medium based on the satellite single task instruction capacity. The technical problem to be solved by the present invention is achieved by the following technical solutions:

[0004] A first aspect of an embodiment of the present invention provides a task injection method based on satellite single-task instruction capacity, comprising the following steps:

[0005] The step of traversing the list of tasks to be added is performed: determining whether the number of instructions of the i-th task to be added in the list of tasks to be added is greater than the instruction capacity threshold; wherein the order of the tasks in the list of tasks to be added is in ascending order of the start time of the initial addition arc segment;

[0006] If not, determine whether the cache list is empty. If not, traverse each added task to be added in the cache list according to the start time of the initial arc segment of the i-th task to be added, and calculate the quasi-remaining amount of the instruction capacity of the cache list;

[0007] When the quasi-remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added, the i-th task to be added is added to the cache list, and the step of traversing the list of tasks to be added is returned to execute;

[0008] When the quasi-remaining amount of the instruction capacity is less than the number of instructions of the i-th task to be added, a quasi-addition arc segment is determined in the available addition arc segments according to the latest execution end time of the tasks to be added that have been added to the cache list;

[0009] According to the start time of the quasi-uploading arc segment, each added task to be uploaded in the cache list is traversed to calculate the quasi-completed remaining amount of the instruction capacity of the cache list;

[0010] When the remaining amount of the instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added, the i-th task to be added is added to the cache list, and the step of traversing the list of tasks to be added is returned to execute.

[0011] In one embodiment of the present invention, the method further comprises:

[0012] If the cache list is empty, add the i-th task to be added to the cache list to obtain the added task to be added, and return to execute the step of traversing the list of tasks to be added.

[0013] In one embodiment of the present invention, the step of traversing each task to be added in the cache list according to the start time of the initial injection arc segment of the i-th task to be injected, and calculating the quasi-remaining amount of the instruction capacity of the cache list includes:

[0014] The step of traversing the cache list is performed: determining whether the start time of the initial betting arc segment of the i-th task to be betted is greater than or equal to the execution end time of the j-th task to be betted that has been added in the cache list;

[0015] If so, the quasi-remaining amount of the instruction capacity of the cache list is calculated based on the current remaining amount of the instruction capacity in the cache list and the number of instructions of the jth task to be added, and the current remaining amount of the instruction capacity of the cache list is updated with the quasi-remaining amount of the instruction capacity, and the step of traversing the cache list is returned.

[0016] In one embodiment of the present invention, determining the quasi-uploading arc segment in the available uploading arc segments according to the latest execution end time of the tasks to be uploaded that have been added to the cache list includes:

[0017] Among the available betting arcs whose start time is greater than the latest execution end time of the tasks to be bet on that have been added to the cache list, and whose difference between the execution start time of the i-th task and the start time of the available betting arc is greater than the preset duration, the available betting arc with the highest arc score shall be used as the quasi-betting arc for the i-th task.

[0018] In one embodiment of the present invention, the method further includes:.

[0019] The arc score is determined based on the length of the available upcast arc and its weight, the weight of whether the available upcast arc is reserved, the elevation angle of the available upcast arc and its weight, and the weight of the time of the available upcast arc.

[0020] In one embodiment of the present invention, traversing each added task to be added in the cache list according to the start time of the quasi-addition arc segment and calculating the quasi-completed remaining amount of the instruction capacity of the cache list includes:

[0021] Execute the traversal step: determine whether the start time of the quasi-annotation arc segment of the i-th task to be added in the cache list is greater than or equal to the execution end time of the j-th task to be added in the cache list;

[0022] If so, the remaining amount of the instruction capacity of the cache list is calculated based on the total number of instructions in the cache list and the number of instructions of the jth task to be added.

[0023] In one embodiment of the present invention, the method further comprises:

[0024] Determine whether the quasi-remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added;

[0025] Determine whether the remaining amount of the instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added.

[0026] A second aspect of an embodiment of the present invention provides a task injection device based on satellite single-task instruction capacity, comprising:

[0027] A judgment module is used to execute the step of traversing the list of tasks to be added: judging whether the number of instructions of the i-th task to be added in the list of tasks to be added is greater than the instruction capacity threshold; wherein the order of the tasks in the list of tasks to be added is in ascending order of the start time of the initial addition arc segment;

[0028] A first calculation module is used to determine whether the cache list is empty if not, and if not, traverse each added task to be added in the cache list according to the start time of the initial injection arc segment of the i-th task to be added, and calculate the quasi-remaining amount of the instruction capacity of the cache list;

[0029] A first adding module is used for adding the i-th task to be added to the cache list when the quasi-remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added, and returning to execute the step of traversing the list of tasks to be added;

[0030] A determination module, configured to determine a quasi-uploading arc segment in the available uploading arc segments according to the latest execution end time of the tasks to be uploaded that have been added to the cache list when the quasi-remaining amount of the instruction capacity is less than the number of instructions of the i-th task to be uploaded;

[0031] A second calculation module is used to traverse each added task to be added in the cache list according to the start time of the quasi-addition arc segment, and calculate the quasi-completed remaining amount of the instruction capacity of the cache list;

[0032] The second adding module is used to add the i-th task to be added to the cache list when the remaining amount of the instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added, and return to execute the step of traversing the list of tasks to be added.

[0033] A third aspect of an embodiment of the present invention provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, a task injection method based on satellite single-task instruction capacity provided by the first aspect of an embodiment of the present invention is implemented.

[0034] A fourth aspect of an embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the task injection method based on the satellite single-task instruction capacity provided by the first aspect of the embodiment of the present invention is implemented.

[0035] Beneficial effects of the present invention:

[0036] The present invention selects appropriate injection tasks and injection arc segments to inject instruction tasks according to the size of the 1A satellite instruction capacity, rationally utilizes resources, and maximizes the use of instruction capacity, so that all instruction tasks can be injected and executed in time, greatly improving the injection efficiency and execution efficiency of instruction tasks.

[0037] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures particularly pointed out in the written description, claims, and drawings.

[0038] The technical solution of the present invention is further described in detail below through the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings:

[0040] Figure 1 A schematic flow chart of a task injection method based on satellite single-task instruction capacity provided by an embodiment of the present invention;

[0041] Figure 2A block diagram of a task injection device based on satellite single-task instruction capacity provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0042] The present invention is further described in detail below with reference to specific embodiments, but the embodiments of the present invention are not limited thereto.

[0043] like Figure 1 As shown, a first aspect of an embodiment of the present invention provides a task injection method based on satellite single task instruction capacity, comprising the following steps:

[0044] Step 11, determining whether the number of instructions of the i-th task to be added in the task list to be added is greater than the instruction capacity threshold.

[0045] The order of the tasks in the task list to be uploaded is sorted in ascending order of the start time of the initial uploaded arc segment.

[0046] Step 12: If not, determine whether the cache list is empty. If not, traverse each added task to be added in the cache list according to the start time of the initial arc segment of the i-th task to be added, and calculate the quasi-remaining amount of the instruction capacity of the cache list.

[0047] Step 13, when the quasi-remaining amount of instruction capacity is greater than or equal to the number of instructions of the i-th task to be added, the i-th task to be added is added to the cache list, and the process returns to step 11.

[0048] Step 14, when the quasi-remaining amount of instruction capacity is less than the number of instructions of the i-th task to be added, a quasi-addition arc is determined in the available addition arcs according to the latest execution end time of the tasks to be added in the cache list.

[0049] Step 15, traverse each added task to be added in the cache list according to the start time of the quasi-added arc segment, and calculate the quasi-completed remaining amount of the instruction capacity of the cache list.

[0050] Step 16, when the remaining amount of instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added, the i-th task to be added is added to the cache list, and the process returns to step 11.

[0051] In this embodiment, when a task registered on the 1A star is completed, the instruction capacity of a task is released. According to the registration arc segment and execution completion time of the task, appropriate registration tasks and registration arc segments are selected to effectively register the instruction tasks, so as to maximize the utilization of instruction capacity and rationally utilize resources, so that all instruction tasks can be registered and executed in time, which greatly improves the registration efficiency and execution efficiency of instruction tasks.

[0052] A second aspect of an embodiment of the present invention provides a task injection method based on satellite single-task instruction capacity, comprising the following steps:

[0053] Step 201, select the i-th task to be added in the task list to be added, and determine whether i is less than or equal to N, where N is the total number of tasks to be added in the task list to be added.

[0054] Step 202: if i is less than or equal to N, determine whether the number of instructions of the i-th task to be added in the task list to be added is greater than the instruction capacity threshold. In this step, the instruction capacity threshold is the maximum instruction capacity of the small star.

[0055] Among them, the tasks in the task list to be added are sorted in ascending order according to the start time of the initial addition arc segment, that is, the start time is sorted from early to late.

[0056] In a feasible implementation, the initial betting arc is calculated in advance, and the process of determining the initial betting arc for each task to be bet on in the task list to be bet on includes steps A1 to A4:

[0057] Step A1, in the available uplink arcs of the satellite, traverse each available uplink arc and each task. All available uplink arcs are grouped according to satellites, and the arcs are stored under the corresponding satellites according to the satellites to which they belong. The available arc list is stored under the corresponding satellite. The arcs under the same satellite are classified according to the ground stations used by the isolated segments, and the isolated segments of different satellites but the same ground stations do not conflict, and the arcs of the same ground station under the same satellite do not conflict. Each satellite has its own available uplink arc.

[0058] Step A2, calculate whether the difference between the start time of the available injection arc segment and the execution start time of the task to be injected is greater than 30 seconds and less than 86400 seconds (1 day).

[0059] Step A3: If the conditions are met, the arc scores of the available arcs that meet the conditions are calculated. Specifically, the specific calculation method of the arc score is introduced in detail in the following content.

[0060] Step A4: If the arc score is greater than the threshold, the available arc is the initial arc of the current task to be added, and the next task to be added is traversed. If the arc score is less than the threshold, the next available arc is traversed.

[0061] Optionally, after step A4, the latest betting time for the task to be bet can be calculated:

[0062] Step A5, calculating the latest injection time of the task to be injected: after obtaining the initial injection arc segment, determine whether the execution start time of the initial injection arc segment overlaps with the execution start time of the task to be injected.

[0063] Step A6: If there is overlap, the latest injection time is the execution start time of the task to be injected;

[0064] If there is no overlap, the latest injection time is the start time of the initial injection arc.

[0065] Step 203, if it is greater, abandon the task and return to step 201 to perform the traversal calculation of the next task to be added. When the number of instructions of the i-th task to be added is greater than the instruction capacity threshold, it means that this task exceeds the maximum instruction capacity of the small star and cannot be added.

[0066] Step 204: If less than or equal to, determine whether the cache list is empty.

[0067] Step 205, if the cache list is empty, add the i-th task to be placed to the cache list, obtain the added task to be placed, return to step 201, and continue to calculate the next task to be placed until i = N. Here, the cache list is used to cache the tasks to be placed that meet the placement conditions and are ready to be placed. If the cache list is empty, it means that there is no cached task in the cache list.

[0068] Step 206, if the cache list is not empty, then traverse each added task to be added in the cache list according to the start time of the initial addition arc segment of the i-th task to be added, and calculate the quasi-remaining amount of the instruction capacity of the cache list.

[0069] In this step, if the cache list is not empty, it means that some tasks to be added have been added to the cache list. These tasks can be called added tasks to be added. The maximum instruction capacity of the tasks that can be added to the cache list is the same as the instruction capacity threshold. At this time, it is necessary to calculate whether the i-th task to be added can be added to the cache list.

[0070] Since Xiaoxing's task is to release the instruction capacity one by one after execution, the start time of the initial injection arc segment of the i-th task to be injected is calculated here to be later than the time when which task in the cache list is completed. In this way, the instruction capacity occupied by the executed tasks will be released, and the i-th task to be injected may be added to the cache list.

[0071] Specifically, the specific steps of calculating the quasi-remaining amount of instruction capacity of the cache list include steps 2051 to 2054:

[0072] Step 2051, calculate the total instruction sum of the existing tasks in the cache list and the remaining instruction capacity, and find the start time of the initial injection arc segment of the i-th task to be injected.

[0073] Step 2052, traverse the added tasks to be added in the cache list: determine whether the start time of the initial addition arc segment of the i-th task to be added is greater than or equal to the execution end time of the j-th task to be added in the cache list.

[0074] Step 2053, if yes, it means that the i-th task to be added is added after the j-th task to be added is completed, then according to the current instruction capacity remaining amount in the cache list and the number of instructions of the j-th task to be added, the quasi-remaining amount of the instruction capacity of the cache list is calculated, and the current instruction capacity remaining amount of the cache list is updated with the quasi-remaining amount of the instruction capacity, and the step of traversing the cache list is returned.

[0075] Specifically, the i-th task to be added is added after the j-th task to be added is completed. At this time, the instruction capacity of the cache list occupied by the j-th task to be added has been released, and the current instruction capacity remaining amount of the cache list is added to the number of instructions of the j-th task to be added to obtain the quasi-remaining amount of the instruction capacity of the cache list. The current instruction capacity remaining amount of the cache list is updated with the quasi-remaining amount of the instruction capacity, and the process returns to step 2052 to traverse the next task to be added until all traversals in the cache list are completed. The quasi-remaining amount is also the maximum instruction capacity value currently remaining in the cache list.

[0076] Step 2054, if not, skip the jth added task to be added, return to step 2052, and continue to traverse the next added task to be added until all the tasks in the cache list are traversed.

[0077] Step 206, determining whether the quasi-remaining amount of instruction capacity is greater than or equal to the number of instructions of the i-th task to be added.

[0078] Step 207, when the quasi-remaining amount of instruction capacity is greater than or equal to the number of instructions of the i-th task to be added, add the i-th task to be added to the cache list, return to step 201, and traverse the next task to be added until i=N.

[0079] Step 208, when the quasi-remaining amount of instruction capacity is less than the number of instructions of the i-th task to be added, a quasi-addition arc is determined in the available addition arcs according to the latest execution end time of the tasks to be added in the cache list.

[0080] In this step, the number of instructions of the i-th task to be added exceeds the quasi-remaining instruction capacity of the cache list, and the i-th task to be added cannot be added to the cache list at the start time of the initial addition arc. At this time, a new addition arc can be found for the i-th task to be added, so that when the new addition time starts, the instruction capacity released by the tasks that have been executed in the cache list is large enough to add the i-th task to be added to the cache list.

[0081] The specific steps of determining the quasi-update arc segment in the available update arc segments according to the latest execution end time of the tasks to be added in the cache list are as follows: among the available update arc segments whose start time is greater than the latest execution end time of the tasks to be added in the cache list, and whose difference between the execution start time of the i-th task and the start time of the available update arc segment is greater than the preset duration, the available update arc segment with the highest arc segment score is used as the quasi-update arc segment for the i-th task.

[0082] Specifically, all tasks in the cache list are sorted in ascending order according to the task execution end time, and the execution end time of the last task is found. Among the available upper bet arcs, multiple preliminary available upper bet arcs with a start time greater than the execution end time of the last task and before the execution start time of the i-th task (for example, more than 30 seconds, that is, the preset duration) are screened, and then the upper bet arc with the highest arc score is screened from these preliminary available upper bet arcs as a new quasi-upper bet arc for the i-th task. The arc score calculation method is the same as the arc score calculation method in step 212.

[0083] Furthermore, the arc score is calculated by: determining the arc score according to the length of the preliminary available up-cast arc and its weight, the weight of whether the preliminary available up-cast arc is reserved, the elevation angle of the preliminary available up-cast arc and its weight, and the weight of the time of the preliminary available up-cast arc. Specifically:

[0084] Evaluating_values=A*dt+appointedBonus+B*maxE+daytimeBouns.

[0085] Here, Evaluating_values ​​indicates the arc score, dt indicates the length of the arc, the weight of the arc length A is 1000, the longest arc does not exceed 10 minutes, appointedBonus indicates whether the arc is scheduled, if not, the weight is 2000, otherwise it is 0. Max indicates the elevation of the arc, the weight of the highest elevation is 500, and daytimeBouns indicates the weight of whether it is during the day, the weight is 1500 during the day (the start time of the arc is between 9:00 and 18:00), otherwise it is 0.

[0086] There may or may not be arc segments that meet the above conditions among the available up-annotated arc segments.

[0087] Step 209, when a quasi-uploading arc segment that meets the above conditions is screened, each task to be uploaded in the cache list that has been added is traversed according to the start time of the quasi-uploading arc segment, and the quasi-completed remaining amount of the instruction capacity of the cache list is calculated. Here, after finding a new quasi-uploading arc segment, it is also necessary to calculate whether the i-th task to be uploaded under the arc segment can be added to the cache list for upload.

[0088] In this step, the method for calculating the quasi-completion remaining amount of the instruction capacity is the same as the method for calculating the quasi-remaining amount of the instruction capacity described above:

[0089] Step 2091, calculate the total instruction sum of the existing tasks in the cache list and the current remaining instruction capacity, and find the start time of the quasi-uploading arc segment of the i-th task to be uploaded.

[0090] Step 2092, traverse the added tasks to be added in the cache list: determine whether the start time of the quasi-addition arc segment of the i-th task to be added is greater than or equal to the execution end time of the j-th task to be added in the cache list.

[0091] Step 2093, if yes, it means that the i-th task to be added is added after the j-th task to be added is completed, then according to the current instruction capacity remaining amount in the cache list and the number of instructions of the j-th task to be added, the quasi-completion remaining amount of the instruction capacity of the cache list is calculated, and the current instruction capacity remaining amount of the cache list is updated with the quasi-remaining amount of the instruction capacity, and then return to step 2092.

[0092] Specifically, the i-th task to be added is added after the j-th task to be added is completed. At this time, the instruction capacity of the cache list occupied by the j-th task to be added has been released. Then the current remaining instruction capacity of the cache list plus the number of released instructions of the j-th task to be added is added to obtain the quasi-completed remaining amount of the instruction capacity of the cache list. The current remaining amount of the instruction capacity of the cache list is updated with the quasi-completed remaining amount of the instruction capacity, and the process returns to step 2092 to traverse the next task to be added until all traversals in the cache list are completed. The quasi-completed remaining amount is also the maximum remaining instruction capacity value of the cache list.

[0093] Step 2094, if not, skip the jth added task to be added, return to step 2052, and continue to traverse the next added task to be added until all the tasks in the cache list are traversed.

[0094] Step 210, determining whether the remaining amount of the instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added.

[0095] Step 211, when the remaining amount of instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added, the i-th task to be added is added to the cache list, the current remaining amount of instruction capacity of the cache list is updated, and the process returns to step 201 until i=N.

[0096] Step 212: When the remaining amount of instruction capacity is less than the number of instructions of the i-th task to be added, the task is abandoned and the process returns to step 201 until i = N. If the number is less than N, the i-th task to be added is abandoned and the process returns to the next task.

[0097] After all the tasks in the betting task list are traversed, the tasks in the cache list are bet on according to the bet arc segment finally determined. Before betting, the latest bet time can also be calculated, and the calculation method is the same as steps A5 and A6, and the task is bet on no later than the latest bet time.

[0098] In the above embodiment, the added tasks to be added in the cache list are sorted in ascending order according to the execution end time of the tasks.

[0099] like Figure 2 As shown, the third aspect of the embodiment of the present invention provides a task injection device based on the satellite single task instruction capacity, comprising:

[0100] The judgment module 21 is used to execute the step of traversing the task list to be added: judging whether the number of instructions of the i-th task to be added in the task list to be added is greater than the instruction capacity threshold; wherein the order of the tasks in the task list to be added is in ascending order of the start time of the initial addition arc segment;

[0101] The first calculation module 22 is used to determine whether the cache list is empty if not, and if not, traverse each added task to be added in the cache list according to the start time of the initial injection arc segment of the i-th task to be added, and calculate the quasi-remaining amount of the instruction capacity of the cache list;

[0102] The first adding module 23 is used for adding the i-th task to be added to the cache list when the quasi-remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added, and returning to execute the step of traversing the list of tasks to be added;

[0103] A determination module 24, configured to determine a quasi-uploading arc segment in the available uploading arc segments according to the latest execution end time of the tasks to be uploaded that have been added to the cache list when the quasi-remaining amount of the instruction capacity is less than the number of instructions of the i-th task to be uploaded;

[0104] The second calculation module 25 is used to traverse each task to be added in the cache list according to the start time of the quasi-filling arc segment, and calculate the quasi-completed remaining amount of the instruction capacity of the cache list;

[0105] The second adding module 26 is used to add the i-th task to be added to the cache list when the remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added, and return to execute the step of traversing the list of tasks to be added.

[0106] In one embodiment of the present invention, if the cache list is empty, the i-th task to be added to the cache list is added to obtain the added task to be added, and the step of traversing the list of tasks to be added is returned.

[0107] In one embodiment of the present invention, each task to be added in the cache list is traversed according to the start time of the initial injection arc segment of the i-th task to be injected, and the quasi-remaining amount of the instruction capacity of the cache list is calculated, including:

[0108] Execute the step of traversing the cache list: determine whether the start time of the initial betting arc segment of the i-th task to be betted is greater than or equal to the execution end time of the j-th task to be betted that has been added in the cache list;

[0109] If so, the quasi-remaining instruction capacity of the cache list is calculated based on the current remaining instruction capacity in the cache list and the number of instructions of the jth task to be added, and the current remaining instruction capacity of the cache list is updated with the quasi-remaining instruction capacity, and the step of traversing the cache list is returned.

[0110] In one embodiment of the present invention, determining a quasi-uploading arc segment in the available uploading arc segments according to the latest execution end time of the tasks to be uploaded that have been added to the cache list includes:

[0111] Among the available betting arcs whose start time is greater than the latest execution end time of the tasks to be bet on that have been added to the cache list, and whose difference between the execution start time of the i-th task and the start time of the available betting arc is greater than the preset duration, the available betting arc with the highest arc score shall be used as the quasi-betting arc for the i-th task.

[0112] In one embodiment of the present invention, the arc score is determined based on the length of the available up-cast arc and its weight, the weight of whether the available up-cast arc is reserved, the elevation angle of the available up-cast arc and its weight, and the weight of the time of the available up-cast arc.

[0113] In one embodiment of the present invention, each added task to be added in the cache list is traversed according to the start time of the quasi-added arc segment, and the quasi-completed remaining amount of the instruction capacity of the cache list is calculated, including:

[0114] Execute traversal step: determine whether the start time of the quasi-annotation arc segment of the i-th task to be annotated in the cache list is greater than or equal to the execution end time of the j-th task to be annotated that has been added in the cache list;

[0115] If so, the remaining amount of instruction capacity of the cache list is calculated based on the total number of instructions in the cache list and the number of instructions of the jth task to be added.

[0116] In one embodiment of the present invention, it is determined whether the quasi-remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added;

[0117] Determine whether the remaining amount of instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added.

[0118] A fourth aspect of an embodiment of the present invention provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, a task injection method based on satellite single-task instruction capacity provided in the above-mentioned embodiment of the present invention is implemented.

[0119] A fifth aspect of an embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of a task injection method based on satellite single-task instruction capacity provided in the above-mentioned embodiment of the present invention are implemented.

[0120] The memory may include a random access memory (RAM) or a non-volatile memory (NVM), such as at least one disk memory. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

[0121] The above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware systems.

[0122] The method provided in the embodiment of the present invention can be applied to electronic devices. Specifically, the electronic device can be: a desktop computer, a portable computer, an intelligent mobile terminal, a server, etc. This is not limited here, and any electronic device that can implement the present invention belongs to the protection scope of the present invention.

[0123] As for the device / electronic device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0124] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (apparatus), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0125] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0126] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0127] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. A task injection method based on satellite single task instruction capacity, characterized in that: The following steps are involved: The step of traversing the list of tasks to be added is performed: determining whether the number of instructions of the i-th task to be added in the list of tasks to be added is greater than the instruction capacity threshold; wherein the order of the tasks in the list of tasks to be added is in ascending order of the start time of the initial addition arc segment; If not, determine whether the cache list is empty. If not, traverse each added task to be added in the cache list according to the start time of the initial arc segment of the i-th task to be added, and calculate the quasi-remaining amount of the instruction capacity of the cache list; When the quasi-remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added, the i-th task to be added is added to the cache list, and the step of traversing the list of tasks to be added is returned to execute; When the quasi-remaining amount of the instruction capacity is less than the number of instructions of the i-th task to be added, a quasi-addition arc segment is determined in the available addition arc segments according to the latest execution end time of the tasks to be added that have been added to the cache list; According to the start time of the quasi-uploading arc segment, each added task to be uploaded in the cache list is traversed to calculate the quasi-completed remaining amount of the instruction capacity of the cache list; When the remaining amount of the instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added, the i-th task to be added is added to the cache list, and the step of traversing the list of tasks to be added is returned to execute.

2. The method according to claim 1, characterized in that The method further comprises: If the cache list is empty, add the i-th task to be added to the cache list to obtain the added task to be added, and return to execute the step of traversing the list of tasks to be added.

3. The method according to claim 1, characterized in that The step of traversing each task to be added in the cache list according to the start time of the initial injection arc segment of the i-th task to be injected, and calculating the quasi-remaining amount of the instruction capacity of the cache list includes: The step of traversing the cache list is performed: determining whether the start time of the initial betting arc segment of the i-th task to be betted is greater than or equal to the execution end time of the j-th task to be betted that has been added in the cache list; If so, the quasi-remaining amount of the instruction capacity of the cache list is calculated based on the current remaining amount of the instruction capacity in the cache list and the number of instructions of the jth task to be added, and the current remaining amount of the instruction capacity of the cache list is updated with the quasi-remaining amount of the instruction capacity, and the step of traversing the cache list is returned.

4. The method according to claim 1, characterized in that The step of determining a quasi-uploading arc segment in the available uploading arc segments according to the latest execution end time of the tasks to be uploaded that have been added to the cache list comprises: Among the available betting arcs whose start time is greater than the latest execution end time of the tasks to be bet on that have been added to the cache list, and whose difference between the execution start time of the i-th task and the start time of the available betting arc is greater than the preset duration, the available betting arc with the highest arc score shall be used as the quasi-betting arc for the i-th task.

5. The method according to claim 4, characterized in that The method also include:. The arc score is determined based on the length of the available upcast arc and its weight, the weight of whether the available upcast arc is reserved, the elevation angle of the available upcast arc and its weight, and the weight of the time of the available upcast arc.

6. The method according to claim 1, characterized in that The traversing each added task to be added in the cache list according to the start time of the quasi-addition arc segment, and calculating the quasi-completed remaining amount of the instruction capacity of the cache list, comprises: Execute the traversal step: determine whether the start time of the quasi-annotation arc segment of the i-th task to be added in the cache list is greater than or equal to the execution end time of the j-th task to be added in the cache list; If so, the remaining amount of the instruction capacity of the cache list is calculated based on the total number of instructions in the cache list and the number of instructions of the jth task to be added.

7. The method according to claim 1, characterized in that The method further comprises: Determine whether the quasi-remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added; Determine whether the remaining amount of the instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added.

8. A task injection device based on satellite single task instruction capacity, characterized in that: include: A judgment module is used to execute the step of traversing the list of tasks to be added: judging whether the number of instructions of the i-th task to be added in the list of tasks to be added is greater than the instruction capacity threshold; wherein the order of the tasks in the list of tasks to be added is in ascending order of the start time of the initial addition arc segment; A first calculation module is used to determine whether the cache list is empty if not, and if not, traverse each added task to be added in the cache list according to the start time of the initial injection arc segment of the i-th task to be added, and calculate the quasi-remaining amount of the instruction capacity of the cache list; A first adding module is used for adding the i-th task to be added to the cache list when the quasi-remaining amount of the instruction capacity is greater than or equal to the number of instructions of the i-th task to be added, and returning to execute the step of traversing the list of tasks to be added; A determination module, configured to determine a quasi-uploading arc segment in the available uploading arc segments according to the latest execution end time of the tasks to be uploaded that have been added to the cache list when the quasi-remaining amount of the instruction capacity is less than the number of instructions of the i-th task to be uploaded; A second calculation module is used to traverse each added task to be added in the cache list according to the start time of the quasi-addition arc segment, and calculate the quasi-completed remaining amount of the instruction capacity of the cache list; The second adding module is used to add the i-th task to be added to the cache list when the remaining amount of the instruction capacity to be completed is greater than or equal to the number of instructions of the i-th task to be added, and return to execute the step of traversing the list of tasks to be added.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the task injection method based on the satellite single-task instruction capacity as described in any one of claims 1 to 7 is implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the task injection method based on satellite single-task instruction capacity described in any one of claims 1 to 7 is implemented.

Images