CN114048015A - Task scheduling method and device - Google Patents
Task scheduling method and device Download PDFInfo
- Publication number
- CN114048015A CN114048015A CN202111356319.4A CN202111356319A CN114048015A CN 114048015 A CN114048015 A CN 114048015A CN 202111356319 A CN202111356319 A CN 202111356319A CN 114048015 A CN114048015 A CN 114048015A
- Authority
- CN
- China
- Prior art keywords
- task
- executed
- task set
- execution time
- tasks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
- G06F9/4887—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues involving deadlines, e.g. rate based, periodic
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a task scheduling method and a task scheduling device, which relate to the technical field of big data, wherein the method comprises the following steps: acquiring a task to be executed; adding the task to be executed into the task set under the condition that the resource required for executing the task to be executed is less than or equal to the residual configuration resource of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the configuration resource and the resource occupation time are pre-configured in the task set; and executing the tasks to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set. The invention takes the task set as the minimum atom to carry out resource scheduling, and can strengthen the unified management of the tasks; and in addition, the tasks in the task set are linearly executed in the appointed time period, so that the resource utilization rate can be improved, and unnecessary resource waste is avoided.
Description
Technical Field
The invention relates to the technical field of big data, in particular to a task scheduling method and device.
Background
This section is intended to provide a background or context to the embodiments of the invention that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
Currently, in a task scheduling system, all tasks can be basically defined as timed tasks or one-time aperiodic tasks. Due to the fact that the task execution length is different, task scheduling mainly includes that a large amount of labor cost is consumed, the execution time length, the time starting point and the time ending point of a task are counted, all tasks are connected in series through task dependence conditions, management of the tasks is particularly disordered, and the resource utilization rate is low.
Disclosure of Invention
The embodiment of the invention provides a task scheduling method, which is used for enhancing the unified management of tasks and improving the resource utilization rate and comprises the following steps:
acquiring a task to be executed;
adding the task to be executed into the task set under the condition that the resource required for executing the task to be executed is less than or equal to the residual configuration resource of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the task set is pre-configured with the configuration resource and the resource occupation time;
and executing the tasks to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set.
The embodiment of the present invention further provides a task scheduling device, configured to strengthen unified management on tasks and improve resource utilization, where the device includes:
the acquisition module is used for acquiring a task to be executed;
the task adding module is used for adding the task to be executed into the task set under the condition that the resource required for executing the task to be executed is less than or equal to the residual configuration resource of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the task set is pre-configured with the configuration resource and the resource occupation time;
and the task execution module is used for executing the tasks to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set.
The embodiment of the invention also provides computer equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the task scheduling method when executing the computer program.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the method for scheduling tasks is implemented.
An embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program, and when the computer program is executed by a processor, the method for task scheduling is implemented.
In the embodiment of the invention, a task to be executed is obtained; adding the task to be executed into the task set under the condition that the resource required for executing the task to be executed is less than or equal to the residual configuration resource of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the configuration resource and the resource occupation time are pre-configured in the task set; and executing the tasks to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set. The invention adds the task to be executed into the task set, configures fixed resources and resource occupation duration for the task set, and performs resource scheduling by taking the task set as the minimum atom, thereby enhancing the unified management of the tasks; and in addition, the tasks in the task set are linearly executed in the appointed time period, so that the resource utilization rate can be improved, and unnecessary resource waste is avoided.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:
fig. 1 is a flowchart of a task scheduling method provided in an embodiment of the present invention;
FIG. 2 is a flowchart of another task scheduling method provided in the embodiment of the present invention;
FIG. 3 is a flowchart of another task scheduling method provided in the embodiment of the present invention;
fig. 4 is a schematic diagram of a task scheduling apparatus according to an embodiment of the present invention;
fig. 5 is a schematic diagram of another task scheduling device provided in the embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. The exemplary embodiments and descriptions of the present invention are provided to explain the present invention, but not to limit the present invention.
In the description of the present specification, the terms "comprising," "including," "having," "containing," and the like are used in an open-ended fashion, i.e., to mean including, but not limited to. Reference to the description of the terms "one embodiment," "a particular embodiment," "some embodiments," "for example," etc., means that a particular feature, structure, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the application. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. The sequence of steps involved in the embodiments is for illustrative purposes to illustrate the implementation of the present application, and the sequence of steps is not limited and can be adjusted as needed.
Research shows that under the current big data development environment, cluster resources are mostly used for running tasks, and as the cumulative number of the tasks is increased and the use of the resources is cumulatively increased, the tasks needing to be managed are mixed, disordered and many; the resources of the cluster are becoming increasingly scarce and scarce. However, the complex tasks and resource utilization of the clusters are mostly caused by the reason that the resource allocation is not fine enough, so the embodiment of the invention provides a task scheduling method to strengthen the unified management of the tasks and improve the resource utilization rate.
As shown in fig. 1, a task scheduling method provided in an embodiment of the present invention includes:
102, adding a task to be executed into a task set under the condition that resources required for executing the task to be executed are less than or equal to residual configuration resources of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the task set is pre-configured with configuration resources and resource occupation time;
and 103, executing the task to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set.
In the embodiment of the invention, a task to be executed is obtained; adding the task to be executed into the task set under the condition that the resource required for executing the task to be executed is less than or equal to the residual configuration resource of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the configuration resource and the resource occupation time are pre-configured in the task set; and executing the tasks to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set. The invention adds the task to be executed into the task set, configures fixed resources and resource occupation duration for the task set, and performs resource scheduling by taking the task set as the minimum atom, thereby enhancing the unified management of the tasks; and in addition, the tasks in the task set are linearly executed in the appointed time period, so that the resource utilization rate can be improved, and unnecessary resource waste is avoided.
In the step 101, the tasks to be executed may be different tasks submitted by the user, and these tasks may be timing starting tasks, short-term tasks executable at one time, or long-term tasks started at one time and running all the time. The resources and duration required for execution may also vary for different tasks to be executed.
For example, the resource required by the task A in running is 2G, and the execution time is 0.5 hour; or the task B is a fixed-type starting task and is executed between 10 and 11 points every day, the execution time of the task B is 1 hour, and the required resources are 1G.
In the step 102, the resources and the duration required for executing the task to be executed are compared with the remaining configured resources and the resource occupation duration of the task set, and the task to be executed is added to the task set when the resources required for executing the task to be executed are less than or equal to the remaining configured resources of the task set and the duration for executing the task to be executed is less than or equal to the resource occupation duration of the task set.
The scheduling platform can pre-configure resources and resource occupation time for the task set, the configured resources are fixed resources of the task set, the resource occupation time is the specified execution time of the task set, and the configuration can be carried out according to specific requirements without taking the required resources and the execution time of a certain task or a plurality of tasks as standards.
The scheduling platform refers to a task scheduling platform similar to the Elasitc-Job, Easy Scheduler, Dolphin Scheduler, etc.
For example, if the configured resource of the task set is 4G, the resource occupation time is 4 hours, but the remaining configured resource of the task set is only 3G, the task whose execution time is less than or equal to 3G of the to-be-executed task may be added to the task set.
In step 103, the task to be executed in the task set is executed within the execution time period corresponding to the resource occupation duration of the task set.
In an embodiment of the present invention, the resource occupation duration of the task set may correspond to a specified execution time period, for example, the resource occupation duration of the task set is 4 hours, and the specified execution time period is 7 to 11 points. Alternatively, the resource occupation duration of the task set may be divided into a plurality of execution time periods.
As shown in fig. 2, in an embodiment of the present invention, after the step 102, the method further includes:
In specific implementation, the resource occupation duration of the task set may be divided into a plurality of execution time periods of any duration, and the resource occupation duration of the task set may be divided into 2 execution time periods, or 3 or 5 execution time periods; the multiple execution time periods can be the same time length or different time lengths, and the total time length of the multiple execution time periods is only required to be equal to the resource occupation time length of the task set. Therefore, how the resource occupation time of the task set is divided is not limited herein.
For example, the resource occupation duration of the task set is 4 hours, and the specified execution time period may be 7 to 9, 11 to 12, 14 to 15; or may be 7 to 8, 10 to 11, 13 to 14, 18 to 19, etc.
After the resource occupation duration of the task set is divided into a plurality of execution time periods in step 201, if the task to be executed is not executed in the first divided execution time period, the task to be executed may be continuously executed in the second execution time period, and so on until the task to be executed in the task set is executed completely.
As shown in fig. 3, in an embodiment of the present invention, the step 103 further includes:
Therefore, by flexibly configuring the task set, the fragment time and the fragment resources can be more reasonably and fully utilized, the resource waste is avoided, and the resource utilization rate is improved.
In this embodiment of the present invention, when the starting time of the execution time period corresponding to the resource occupation duration of the task set is reached, and the task to be executed in the task set is executed in step 103, specifically, the method includes:
and sequentially executing the tasks to be executed according to the priority order of the tasks in the execution time period corresponding to the resource occupation duration of the task set.
In specific implementation, the task priority may be set by the user according to actual needs, or may be set automatically according to a preset rule in the task set, for example, according to a time sequence of adding the task set, or according to a sequence of task names, and the like, which is not limited herein.
In this embodiment of the present invention, the tasks in the task set may also be executed in parallel, and when the task to be executed in the task set is executed in step 103, the method specifically includes:
and executing a plurality of tasks to be executed in the task set in parallel within an execution time period corresponding to the resource occupation duration of the task set.
In specific implementation, the number of the tasks to be executed in parallel is not limited herein, and the resource required by a single task to be executed in parallel is not limited herein, but the total resource required by a plurality of tasks to be executed in parallel is less than or equal to the configuration resource of the task set.
For example, if the configuration resource of the task set is 4G, two tasks whose required resources are 2G memories can be executed simultaneously; or the required resources are 4 tasks of the 1G memory; or simultaneously executing a task with the required resource of 3G memory and a task with the required resource of 1G memory, and the like.
It should be noted that, in the embodiment of the present invention, the scheduling level of the scheduling platform does not have a concept of a task, all the tasks are scheduled with the task set as the minimum atom, the concept of the task is only present in the task set, and the operation of the task is allocated based on the fixed configuration resources and the resource occupation duration in the task set.
The embodiment of the invention also provides a task scheduling device, which is described in the following embodiment. Because the principle of the device for solving the problems is similar to the task scheduling method, the implementation of the device can refer to the implementation of the task scheduling method, and repeated parts are not described again.
As shown in fig. 4, which is a schematic diagram of a task scheduling apparatus according to an embodiment of the present invention, the apparatus includes:
an obtaining module 401, configured to obtain a task to be executed;
a task adding module 402, configured to add a task to be executed to a task set when resources required for executing the task to be executed are less than or equal to remaining configured resources of the task set and a duration of executing the task to be executed is less than or equal to a resource occupation duration of the task set, where the task set is preconfigured with configured resources and resource occupation durations;
the task execution module 403 is configured to execute the to-be-executed task in the task set within an execution time period corresponding to the resource occupation duration of the task set.
In an embodiment of the present invention, the task execution module 403 is specifically configured to:
and sequentially executing the tasks to be executed according to the priority order of the tasks in the execution time period corresponding to the resource occupation duration of the task set.
In an embodiment of the present invention, the task execution module 403 is further specifically configured to:
and executing a plurality of tasks to be executed in the task set in parallel within an execution time period corresponding to the resource occupation duration of the task set.
In an embodiment of the present invention, as shown in fig. 5, the apparatus shown in fig. 4 further includes a time period dividing module 501:
the method is used for dividing the resource occupation duration of the task set into a plurality of execution time periods, and the total duration of the execution time periods is equal to the resource occupation duration of the task set.
In an embodiment of the present invention, in the apparatus shown in fig. 5, the task execution module 403 is further specifically configured to:
executing the tasks to be executed in the task set in a first execution time period of the plurality of execution time periods;
and if the tasks to be executed in the task set are not completely executed in the first execution time period, continuing to execute in the second execution time period of the plurality of execution time periods, and so on until the tasks to be executed in the task set are completely executed.
The embodiment of the invention also provides computer equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the task scheduling method when executing the computer program.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the method for scheduling tasks is implemented.
An embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program, and when the computer program is executed by a processor, the method for task scheduling is implemented.
In the embodiment of the invention, a task to be executed is obtained; adding the task to be executed into the task set under the condition that the resource required for executing the task to be executed is less than or equal to the residual configuration resource of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the configuration resource and the resource occupation time are pre-configured in the task set; and executing the tasks to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set. The invention adds the task to be executed into the task set, configures fixed resources and resource occupation duration for the task set, and performs resource scheduling by taking the task set as the minimum atom, thereby enhancing the unified management of the tasks; and in addition, the tasks in the task set are linearly executed in the appointed time period, so that the resource utilization rate can be improved, and unnecessary resource waste is avoided.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (13)
1. A method for task scheduling, comprising:
acquiring a task to be executed;
adding the task to be executed into the task set under the condition that the resource required for executing the task to be executed is less than or equal to the residual configuration resource of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the task set is pre-configured with the configuration resource and the resource occupation time;
and executing the tasks to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set.
2. The method of claim 1, wherein executing the task to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set comprises:
and sequentially executing the tasks to be executed according to the priority order of the tasks in the execution time period corresponding to the resource occupation duration of the task set.
3. The method of claim 1, wherein executing the task to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set comprises:
and executing a plurality of tasks to be executed in the task set in parallel within an execution time period corresponding to the resource occupation duration of the task set.
4. The method of claim 1, further comprising:
and dividing the resource occupation duration of the task set into a plurality of execution time periods, wherein the total duration of the execution time periods is equal to the resource occupation duration of the task set.
5. The method of claim 4, wherein executing the task to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set comprises:
executing the tasks to be executed in the task set in a first execution time period of the plurality of execution time periods;
and if the tasks to be executed in the task set are not completely executed in the first execution time period, continuing to execute in the second execution time period of the plurality of execution time periods, and so on until the tasks to be executed in the task set are completely executed.
6. A task scheduling apparatus, comprising:
the acquisition module is used for acquiring a task to be executed;
the task adding module is used for adding the task to be executed into the task set under the condition that the resource required for executing the task to be executed is less than or equal to the residual configuration resource of the task set and the time for executing the task to be executed is less than or equal to the resource occupation time of the task set, wherein the task set is pre-configured with the configuration resource and the resource occupation time;
and the task execution module is used for executing the tasks to be executed in the task set within the execution time period corresponding to the resource occupation duration of the task set.
7. The apparatus of claim 6, the task execution module to:
and sequentially executing the tasks to be executed according to the priority order of the tasks in the execution time period corresponding to the resource occupation duration of the task set.
8. The apparatus of claim 6, wherein the task execution module is specifically configured to:
and executing a plurality of tasks to be executed in the task set in parallel within an execution time period corresponding to the resource occupation duration of the task set.
9. The apparatus of claim 6, further comprising:
and the time period dividing module is used for dividing the resource occupation time of the task set into a plurality of execution time periods, wherein the total time of the execution time periods is equal to the resource occupation time of the task set.
10. The apparatus of claim 9, wherein the task execution module is specifically configured to:
executing the tasks to be executed in the task set in a first execution time period of the plurality of execution time periods;
and if the tasks to be executed in the task set are not completely executed in the first execution time period, continuing to execute in the second execution time period of the plurality of execution time periods, and so on until the tasks to be executed in the task set are completely executed.
11. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 5 when executing the computer program.
12. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the method of any of claims 1 to 5.
13. A computer program product, characterized in that the computer program product comprises a computer program which, when being executed by a processor, carries out the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111356319.4A CN114048015A (en) | 2021-11-16 | 2021-11-16 | Task scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111356319.4A CN114048015A (en) | 2021-11-16 | 2021-11-16 | Task scheduling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114048015A true CN114048015A (en) | 2022-02-15 |
Family
ID=80209450
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111356319.4A Pending CN114048015A (en) | 2021-11-16 | 2021-11-16 | Task scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114048015A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114611995A (en) * | 2022-03-30 | 2022-06-10 | 精英数智科技股份有限公司 | Process scheduling method and system |
-
2021
- 2021-11-16 CN CN202111356319.4A patent/CN114048015A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114611995A (en) * | 2022-03-30 | 2022-06-10 | 精英数智科技股份有限公司 | Process scheduling method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112540841B (en) | Task scheduling method and device, processor and electronic equipment | |
| CN111858055B (en) | Task processing method, server and storage medium | |
| US20130205141A1 (en) | Quality of Service Targets in Multicore Processors | |
| CN104461710A (en) | Method and device for processing tasks | |
| CN109597687B (en) | Resource allocation method and device for data synchronization, storage medium and electronic equipment | |
| CN114048015A (en) | Task scheduling method and device | |
| CN105022668A (en) | Job scheduling method and system | |
| CN110569129A (en) | Resource allocation method and device, storage medium and electronic device | |
| CN112328289B (en) | Firmware upgrading method, device, equipment and storage medium | |
| US10042414B2 (en) | Concurrent network application scheduling for reduced power consumption | |
| CN116880986A (en) | Task scheduling method and device, vehicle-mounted controller, electronic equipment and storage medium | |
| WO2022083297A1 (en) | Single-core multi-task scheduling method and system for physical layer of wireless network | |
| CN115002187A (en) | Binding relationship processing method and related equipment | |
| CN114416311A (en) | Method and device for managing message queue based on Go language | |
| CN113127289B (en) | Resource management method, computer equipment and storage medium based on YARN cluster | |
| CN110728838B (en) | Meter reading method and device and power acquisition terminal | |
| CN113468442A (en) | Resource bit flow distribution method, computing device and computer storage medium | |
| CN114546631A (en) | Task scheduling method, control method, core, electronic device and readable medium | |
| CN113760494A (en) | Task scheduling method and device | |
| CN112416539B (en) | Multi-task parallel scheduling method for heterogeneous many-core processor | |
| CN110554922A (en) | System resource allocation method and device | |
| CN112241480A (en) | Mass data storage query device and method based on hadoop cluster | |
| CN110113434B (en) | Method, device and equipment for balancing automatic scheduling of jobs and storage medium | |
| CN111355491A (en) | Single-channel analog signal sampling method and device | |
| CN110647407A (en) | Data configuration method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |