CN110018906B - Scheduling method, server and scheduling system - Google Patents
Scheduling method, server and scheduling system Download PDFInfo
- Publication number
- CN110018906B CN110018906B CN201910141399.8A CN201910141399A CN110018906B CN 110018906 B CN110018906 B CN 110018906B CN 201910141399 A CN201910141399 A CN 201910141399A CN 110018906 B CN110018906 B CN 110018906B
- Authority
- CN
- China
- Prior art keywords
- information
- target task
- scheduling
- task
- time
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000004364 calculation method Methods 0.000 claims description 36
- 238000013468 resource allocation Methods 0.000 claims description 5
- 238000012937 correction Methods 0.000 claims description 4
- 239000000126 substance Substances 0.000 claims 1
- 238000012544 monitoring process Methods 0.000 abstract description 5
- 238000004891 communication Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000001960 triggered effect Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000003032 molecular docking Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
Abstract
The embodiment of the invention relates to the field of communication, and discloses a scheduling method, a server and a scheduling system. In the invention, a scheduling method is applied to a server and comprises the following steps: acquiring configuration information, wherein the configuration information at least comprises N pieces of task information and first time information respectively corresponding to the N pieces of task information, a first preset corresponding relation exists between the task information and the first time information, and N is a natural number greater than or equal to 1; if the triggering operation of the target task is detected, acquiring first time information corresponding to the target task according to a first preset corresponding relation in the configuration information; and executing scheduling operation on the target task according to the first time information corresponding to the target task. The embodiment of the invention also provides a server and a scheduling system; the scheduling operation can be executed according to the set time, the manual real-time monitoring of the scheduling state and the remote triggering of the scheduling operation are not needed, and all scheduling tasks can be uniformly controlled.
Description
Technical Field
The embodiment of the invention relates to the field of communication, in particular to a scheduling method, a server and a scheduling system.
Background
Scheduling refers to a method of allocating resources required for a job in a computer. Resources as referred to herein may refer to virtual computing resources such as threads, processes, or data streams; but also hardware resources such as processors, network connections or expansion cards.
The inventor finds that at least the following problems exist in the prior art: in the prior art, the dispatching state needs to be monitored manually in real time and dispatching operation needs to be triggered remotely, so that the requirement on real-time performance is high; and respectively manages different scheduling tasks.
Disclosure of Invention
The embodiment of the invention aims to provide a scheduling method, a server and a scheduling system, which can execute scheduling operation according to set time without manually monitoring a scheduling state in real time and remotely triggering the scheduling operation, and can uniformly manage and control all scheduling tasks.
In order to solve the above technical problem, an embodiment of the present invention provides a scheduling method, applied to a server, including: acquiring configuration information, wherein the configuration information at least comprises N pieces of task information and first time information respectively corresponding to the N pieces of task information, a first preset corresponding relation exists between the task information and the first time information, and N is a natural number greater than or equal to 1; if the triggering operation of the target task is detected, acquiring first time information corresponding to the target task according to a first preset corresponding relation in the configuration information; and executing scheduling operation on the target task according to the first time information corresponding to the target task.
An embodiment of the present invention further provides a server, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the scheduling method as described above.
The embodiment of the invention also provides a scheduling system, which comprises the controlled terminal and the server.
Compared with the prior art, the embodiment of the invention provides a scheduling method, which is applied to a server, and comprises at least N pieces of task information and configuration information of first time information respectively corresponding to the N pieces of task information, wherein the task information and the first time information have a first preset corresponding relation, and N is a natural number greater than or equal to 1; after the triggering operation of the target task is detected, acquiring first time information corresponding to the target task according to a first preset corresponding relation in the configuration information; and then, according to the first time information corresponding to the target task, executing scheduling operation on the target task. In the embodiment, when the target task is triggered, the scheduling operation is executed on the target task according to the set first time information, so that the computing unit executing the scheduling operation can autonomously execute the scheduling operation according to the first time information, and therefore, the manual real-time monitoring of the scheduling state and the remote triggering of the scheduling operation are not needed, the labor can be saved, and the scheduling efficiency can be improved; the N pieces of task information included in the configuration information can be all the task information of each merchant, so that the scheduling tasks of different merchants do not need to be respectively controlled, and the allocation of the computing resources in all the scheduling tasks can be uniformly realized.
In addition, the configuration information further includes: service information; the first time information is set in the service information; the first preset corresponding relationship specifically includes: the service information of the task information and the first time information has a first preset corresponding relation; according to the first time information corresponding to the target task, scheduling operation is executed on the target task, and the method specifically comprises the following steps: acquiring service information corresponding to the target task according to the first preset corresponding relation; and executing scheduling operation on the target task by combining the service information corresponding to the target task and the first time information corresponding to the target task in the service information. In this embodiment, the configuration information further includes service information, which provides a specific implementation manner for performing scheduling operation on the target task, and is beneficial to the flexible implementation of the scheduling method in this embodiment.
In addition, the configuration information further includes: calculating information; calculating a second preset corresponding relation between the information and the service information; according to the first time information corresponding to the target task and the service information corresponding to the target task, scheduling operation is performed on the target task, and the method specifically includes: acquiring calculation information corresponding to the service information according to the second preset corresponding relation; and executing scheduling operation on the target task by combining the first time information corresponding to the target task, the service information corresponding to the target task and the calculation information corresponding to the service information. In this embodiment, the configuration information further includes calculation information to facilitate the scheduling operation performed on the target task.
In addition, the calculation information further includes: second time information; the second time information is specifically: second time information corresponding to the target task is obtained after adjustment is carried out on the basis of the first time information; according to the first time information corresponding to the target task, scheduling operation is executed on the target task, and the method specifically comprises the following steps: if the second time information corresponding to the target task exists, executing scheduling operation on the target task according to the second time information corresponding to the target task; otherwise, according to the first time information corresponding to the target task, executing scheduling operation on the target task. In the embodiment, by setting the second time information, relevant workers can conveniently adjust the scheduling requirements based on the first time information, so that certain special scheduling requirements in practical application can be met.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the figures in which like reference numerals refer to similar elements and which are not to scale unless otherwise specified.
Fig. 1 is a flowchart of a scheduling method according to a first embodiment of the present invention;
fig. 2 is a schematic structural diagram of a scheduling method according to a first embodiment of the present invention;
fig. 3 is a flowchart of a scheduling method according to a second embodiment of the present invention;
fig. 4 is a schematic structural diagram of a server according to a third embodiment of the present invention;
fig. 5 is a schematic structural diagram of a scheduling system according to a fourth 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, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that numerous technical details are set forth in order to provide a better understanding of the present application in various embodiments of the present invention. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments.
A first embodiment of the present invention relates to a scheduling method. The method comprises the steps that the method is applied to a server, configuration information at least comprising N pieces of task information and first time information respectively corresponding to the N pieces of task information is obtained, the task information and the first time information have a first preset corresponding relation, and N is a natural number larger than or equal to 1; after the triggering operation of the target task is detected, acquiring first time information corresponding to the target task according to a first preset corresponding relation in the configuration information; and then, according to the first time information corresponding to the target task, executing scheduling operation on the target task.
In the embodiment, when the target task is triggered, the scheduling operation is executed on the target task according to the set first time information, so that the computing unit executing the scheduling operation can autonomously execute the scheduling operation according to the first time information, and therefore, the manual real-time monitoring of the scheduling state and the remote triggering of the scheduling operation are not needed, the labor can be saved, and the scheduling efficiency can be improved; the N pieces of task information included in the configuration information can be all the task information of each merchant, so that the scheduling tasks of different merchants do not need to be respectively controlled, and the allocation of the computing resources in all the scheduling tasks can be uniformly realized.
The following describes implementation details of the scheduling method in this embodiment in detail, and the following is only provided for easy understanding and is not necessary for implementing this embodiment.
A flowchart of a scheduling method in the present embodiment is shown in fig. 1, and includes:
Specifically, the first time information in this embodiment may be: first time information indicating a time interval for performing a scheduling operation. In practical applications, the computing unit may perform the scheduling operation according to a time interval represented by the first time information, where the time interval may be 10 seconds, 30 seconds, 60 seconds, and the like, and is not limited herein.
The task information in this embodiment may include: dimension information, task execution mode information and time correction information for time correction; the dimension information is used for determining a calculation mode of a calculation unit for executing the calculation resource allocation. The dimension information here may be an order dimension, a warehouse dimension, and the like. For example, in a computing resource deployment process, the calculations performed by the computing unit regarding orders may be based on store dimensions, the calculations performed by the computing unit regarding warehouse docking may be based on warehouse dimensions, and so on.
The task execution mode in the task execution mode information may include: a first task execution mode in which the calculation unit performs the calculation only once in the same scheduling operation, and a second task execution mode in which the calculation unit performs the calculation a plurality of times in the same scheduling operation. Because some computing units take long time for computation and some short time for computation, the second task execution mode is set, so that the computing units which take short time for computation can be called up twice to execute the scheduling operation when the time for next computation resource allocation execution is met.
That is to say, after the trigger operation of the controlled terminal on the target task is detected, the first time information corresponding to the target task is acquired according to the first preset corresponding relationship in the configuration information.
In this embodiment, the configuration information may further include: service information; the first time information is set in the service information; the service information of the task information and the first time information has a first preset corresponding relation; according to the first time information corresponding to the target task, scheduling operation is executed on the target task, and the method specifically comprises the following steps: acquiring service information corresponding to the target task according to the first preset corresponding relation; and executing scheduling operation on the target task by combining the service information corresponding to the target task and the first time information corresponding to the target task in the service information. The service information may include: location information of the server, the number of threads for performing the allocation of computing resources, status information of the services provided. The state referred to herein may be a service disabled state or a service enabled state. Related staff members can increase or decrease computing resources by adjusting service enabling states, issuing new services to target tasks, or disabling certain services.
In addition, the configuration information in the present embodiment may further include: calculating information; calculating a second preset corresponding relation between the information and the service information; according to the first time information corresponding to the target task and the service information corresponding to the target task, scheduling operation is performed on the target task, and the method specifically includes: acquiring calculation information corresponding to the service information according to the second preset corresponding relation; and executing scheduling operation on the target task by combining the service information corresponding to the target task, the first time information corresponding to the target task in the service information and the calculation information corresponding to the service information. The calculation information may include: the method comprises the following steps of calculating unit information for executing calculation resource allocation, the number of threads available for the calculating units, the time of executing the scheduling operation last time, the time of executing the scheduling operation next time obtained according to the first time information, the state information of each calculating unit and the result information of executing the scheduling operation.
For example, when a merchant is conducting a sales promotion, the relevant staff may increase the parameter settings for the number of threads in the server where the allocation of computing resources can be performed and the number of threads available to the computing unit, so that orders can be processed several tens of times as much as usual.
It is to be noted that, in this embodiment, the controlled terminal may issue multiple service instances to the server corresponding to the target task, and the server enables the service corresponding to the target task, that is, performs the scheduling operation on the target task by combining the service information corresponding to the target task and the first time information corresponding to the target task in the service information, where the multiple service instances may perform the scheduling operation of distributed computation by preempting the computing unit.
And executing scheduling operation on the target task based on a task-service-calculation three-layer architecture by providing task information, service information and calculation information. In practical application, relevant workers can realize seamless connection of merchants in daily sales and promotion sales by setting parameter information in task information, service information and calculation information, and adjust the performance of scheduling calculation in time.
And 103, executing scheduling operation on the target task according to the first time information corresponding to the target task.
For example, if the first time information corresponding to the target task is 20s, the computing unit executes the scheduling operation once every 20 s.
Specifically, according to the configuration information, the target task is subjected to preemptive calculation, and distributed calculation is executed to complete scheduling operation. Fig. 2 is a schematic structural diagram showing a structure in which three service instances, namely a service instance a, a service instance B, and a service instance C, are issued for a target task, and are preempted by computing units a to F and distributed computing is performed. Since the steps for performing the distributed computing operation are the same as those in the prior art, they are not described herein again. It should be noted that, in this embodiment, the computing unit may be preempted according to a preset priority, for example, the computing unit with a higher priority level set by the user performs preemption preferentially, and this embodiment is not limited in particular.
It should be noted that, in this embodiment, by setting the configuration information, unified logs, unified exception handling, unified alarm reaching, and unified multithread can be realized, which is beneficial to making the code structure consistent, facilitating the later maintenance of the code by the relevant staff, and improving the work efficiency.
As can be easily found, according to the scheduling method provided by the embodiment, when a target task is triggered, a scheduling operation is performed on the target task according to the set first time information, so that a computing unit executing the scheduling operation can autonomously perform the scheduling operation according to the first time information, and therefore, a manual real-time monitoring of a scheduling state and a remote triggering of the scheduling operation are not required, thereby saving manpower and improving scheduling efficiency; the N pieces of task information included in the configuration information can be all the task information of each merchant, so that the scheduling tasks of different merchants do not need to be respectively controlled, and the allocation of the computing resources in all the scheduling tasks can be uniformly realized.
A second embodiment of the present invention relates to a scheduling method. The embodiment is further improved on the basis of the first embodiment, and the specific improvement is as follows: in the second embodiment of the present invention, the calculation information further includes: second time information; the second time information is specifically: second time information corresponding to the target task is obtained after adjustment is carried out on the basis of the first time information; in the present embodiment: if the second time information exists, executing scheduling operation on the target task according to the second time information; otherwise, according to the first time information corresponding to the target task, executing scheduling operation on the target task. In the embodiment, by setting the second time information, relevant workers can conveniently adjust the scheduling requirements based on the first time information, so that certain special scheduling requirements in practical application can be met.
Fig. 3 shows a flowchart of a scheduling method in the present embodiment, which includes:
Specifically, in this embodiment, the calculating information further includes: second time information; the second time information is specifically: and the second time information corresponding to the target task is obtained after adjustment is carried out based on the first time information, so that certain special scheduling requirements in practical application can be met. For example, if the first time information corresponding to the target task is 20s, and if it is found that the time of 20s is not enough to meet the actual scheduling requirement after the operation, the relevant staff may adjust based on the first time information, for example, set the second time information in the calculation information to be 30s, so as to meet the actual requirement.
And step 204, executing scheduling operation on the target task according to the first time information corresponding to the target task.
Since steps 203 to 204 in this embodiment are substantially the same as steps 102 to 103 in the first embodiment, they are not described herein again to avoid repetition.
And step 205, executing scheduling operation on the target task according to the second time information corresponding to the target task.
For example, if the first time information is 20 seconds and the second time information is 30 seconds, the scheduling operation is performed on the target task according to the second time information, that is, 30 seconds.
As can be easily found, in the scheduling method provided by this embodiment, the calculating information further includes: second time information; the second time information is specifically: second time information corresponding to the target task is obtained after adjustment is carried out on the basis of the first time information; in the present embodiment: if the second time information exists, executing scheduling operation on the target task according to the second time information; otherwise, according to the first time information corresponding to the target task, executing scheduling operation on the target task. In the embodiment, by setting the second time information, relevant workers can conveniently adjust the scheduling requirements based on the first time information, so that certain special scheduling requirements in practical application can be met.
The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.
A third embodiment of the present invention relates to a server, as shown in fig. 4, including: at least one processor 302; and a memory 301 communicatively coupled to the at least one processor 302; the memory 301 stores instructions executable by the at least one processor 302, and the instructions are executed by the at least one processor 302 to enable the at least one processor 302 to execute the scheduling method according to any one of the first to second embodiments.
Where the memory 301 and processor 302 are coupled in a bus, the bus may comprise any number of interconnected buses and bridges that couple one or more of the various circuits of the processor 302 and memory 301 together. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor 302 is transmitted over a wireless medium through an antenna, which further receives the data and transmits the data to the processor 302.
The processor 302 is responsible for managing the bus and general processing and may also provide various functions including timing, peripheral interface, voltage regulation, power management, and other control functions. And memory 301 may be used to store data used by processor 302 in performing operations.
A fourth embodiment of the present invention relates to a scheduling system including a controlled terminal, and the server in the third embodiment.
Specifically, the number of controlled terminals in this embodiment is generally plural, as shown in fig. 5. The server may provide a Software Development Kit (SDK), and the controlled terminal may cache configuration information provided by the server to solve a situation in which the server is frequently called, and in doing so, the controlled terminal may perform a scheduling operation according to the cached configuration information even if the controlled terminal is in a disconnected state at the server.
This embodiment is a system example corresponding to the first embodiment, and may be implemented in cooperation with the first embodiment. The related technical details mentioned in the first embodiment are still valid in this embodiment, and are not described herein again in order to reduce repetition. Accordingly, the related-art details mentioned in the present embodiment can also be applied to the first embodiment.
Those skilled in the art will understand that all or part of the steps in the method according to the above embodiments may be implemented by a program instructing related hardware to complete, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, etc.) or a processor (processor) to execute all or part of the steps in the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples for carrying out the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.
Claims (10)
1. A scheduling method applied to a server includes:
acquiring configuration information, wherein the configuration information at least comprises N pieces of task information and first time information respectively corresponding to the N pieces of task information;
the task information and the first time information have a first preset corresponding relation, and N is a natural number greater than or equal to 1; the task information includes: dimension information and task execution mode information; the dimension information is used for determining a calculation mode of a calculation unit for executing calculation resource allocation; the task execution mode information is any one of: a first task execution mode in which the calculation unit performs one calculation in the same scheduling operation, and a second task execution mode in which the calculation unit performs a plurality of calculations in the same scheduling operation;
if the triggering operation of the target task is detected, acquiring first time information corresponding to the target task according to the first preset corresponding relation in the configuration information;
and executing scheduling operation on the target task according to the first time information corresponding to the target task.
2. The scheduling method according to claim 1, wherein the first time information specifically includes: first time information indicating a time interval for performing the scheduling operation.
3. The scheduling method of claim 1, wherein the configuration information further comprises: service information; the first time information is set in the service information;
the first preset corresponding relationship specifically includes: the task information and the service information where the first time information is located have the first preset corresponding relation;
the executing, according to the first time information corresponding to the target task, a scheduling operation on the target task specifically includes:
acquiring service information corresponding to the target task according to the first preset corresponding relation;
and executing scheduling operation on the target task by combining the service information corresponding to the target task and the first time information corresponding to the target task in the service information.
4. The scheduling method of claim 3, wherein the service information further comprises:
location information of the server, number of threads for which a provisioning of computing resources may be performed, status information of enablement or disablement of a service.
5. The scheduling method of claim 3, wherein the configuration information further comprises: calculating information; the calculation information and the service information have a second preset corresponding relation;
the executing, according to the first time information corresponding to the target task and the service information corresponding to the target task, a scheduling operation on the target task specifically includes:
acquiring calculation information corresponding to the service information according to the second preset corresponding relation;
and executing scheduling operation on the target task by combining the service information corresponding to the target task, the first time information corresponding to the target task in the service information and the calculation information corresponding to the service information.
6. The scheduling method according to claim 5, wherein the calculating information specifically includes: the scheduling method comprises the following steps of calculating unit information of a calculating unit used for executing calculation resource allocation, the number of threads available for the calculating unit, the time of executing the scheduling operation last time, the time of executing the scheduling operation next time obtained according to the first time information, state information of each calculating unit and result information of executing the scheduling operation.
7. The scheduling method of claim 6 wherein the computing information further comprises: second time information; the second time information specifically includes: second time information corresponding to the target task is obtained after adjustment is carried out on the basis of the first time information;
executing scheduling operation on the target task according to the first time information corresponding to the target task, specifically including:
if the second time information corresponding to the target task exists, executing scheduling operation on the target task according to the second time information corresponding to the target task; otherwise, according to the first time information corresponding to the target task, executing scheduling operation on the target task.
8. The scheduling method according to any one of claims 1 to 7, wherein the task information further includes: time correction information for time correction.
9. A server, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the scheduling method of any one of claims 1 to 8.
10. A scheduling system comprising a controlled terminal and a server according to claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910141399.8A CN110018906B (en) | 2019-02-26 | 2019-02-26 | Scheduling method, server and scheduling system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910141399.8A CN110018906B (en) | 2019-02-26 | 2019-02-26 | Scheduling method, server and scheduling system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110018906A CN110018906A (en) | 2019-07-16 |
| CN110018906B true CN110018906B (en) | 2020-11-27 |
Family
ID=67189098
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910141399.8A Expired - Fee Related CN110018906B (en) | 2019-02-26 | 2019-02-26 | Scheduling method, server and scheduling system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110018906B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115767711A (en) * | 2021-09-03 | 2023-03-07 | 维沃移动通信有限公司 | Information processing method, device, communication equipment and readable storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103092693A (en) * | 2013-01-30 | 2013-05-08 | 深圳联友科技有限公司 | Task scheduling method and system for computer |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5011028B2 (en) * | 2007-08-23 | 2012-08-29 | 株式会社日立製作所 | Storage system, management apparatus, scheduling method, program, recording medium |
| CN101488872B (en) * | 2009-01-09 | 2011-02-09 | 哈尔滨工业大学 | Biological information computing grid system |
| CN102393822B (en) * | 2011-11-30 | 2014-03-12 | 中国工商银行股份有限公司 | Batch scheduling system and method |
| CN104765641B (en) * | 2014-01-02 | 2019-04-12 | 中国移动通信集团安徽有限公司 | A kind of job scheduling method and system |
| CN107577589A (en) * | 2016-07-04 | 2018-01-12 | 北京奇虎科技有限公司 | The method and device of fixed time test advertisement putting interface |
| US10445680B2 (en) * | 2017-02-02 | 2019-10-15 | Azuqua, Inc. | Engine for modeling and executing custom business processes |
| CN108628669A (en) * | 2018-04-25 | 2018-10-09 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus of scheduling machine learning algorithm task |
| CN108683730B (en) * | 2018-05-11 | 2021-08-06 | 深圳市网心科技有限公司 | Resource scheduling method, service server, client terminal, network system and medium |
-
2019
- 2019-02-26 CN CN201910141399.8A patent/CN110018906B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103092693A (en) * | 2013-01-30 | 2013-05-08 | 深圳联友科技有限公司 | Task scheduling method and system for computer |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110018906A (en) | 2019-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109408205B (en) | Task scheduling method and device based on hadoop cluster | |
| CN107748696B (en) | Task scheduling method and terminal equipment | |
| US9262220B2 (en) | Scheduling workloads and making provision decisions of computer resources in a computing environment | |
| CN104657212A (en) | Task scheduling method and system | |
| CN105049268A (en) | Distributed computing resource allocation system and task processing method | |
| CN110389816B (en) | Method, apparatus and computer readable medium for resource scheduling | |
| CN109478147B (en) | Adaptive resource management in distributed computing systems | |
| CN106557369A (en) | A kind of management method and system of multithreading | |
| WO2023051505A1 (en) | Job solving method and apparatus | |
| CN112380020A (en) | Computing power resource allocation method, device, equipment and storage medium | |
| CN112486642B (en) | Resource scheduling method, device, electronic equipment and computer readable storage medium | |
| CN111191777B (en) | Neural network processor and control method thereof | |
| CN111208992A (en) | System scheduling workflow generation method and system | |
| CN115033352A (en) | Task scheduling method, device and equipment for multi-core processor and storage medium | |
| CN114461355A (en) | Heterogeneous computing cluster unified management method and device, electronic equipment and storage medium | |
| CN111459629A (en) | Azkaban-based project operation method and device and terminal equipment | |
| CN110018906B (en) | Scheduling method, server and scheduling system | |
| CN114490048A (en) | Task execution method and device, electronic equipment and computer storage medium | |
| CN112948081A (en) | Method, device and equipment for processing task in delayed mode and storage medium | |
| CN115373826B (en) | Task scheduling method and device based on cloud computing | |
| CN109308219B (en) | Task processing method and device and distributed computer system | |
| CN108833532B (en) | Service processing method, device and system based on Internet of things | |
| CN115756822A (en) | Method and system for optimizing performance of high-performance computing application | |
| CN115237574A (en) | Scheduling method and device of artificial intelligence chip and electronic equipment | |
| CN114564249A (en) | Recommendation scheduling engine, recommendation scheduling method, and computer-readable storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201127 |