CN110175078B - Service processing method and device - Google Patents
Service processing method and device Download PDFInfo
- Publication number
- CN110175078B CN110175078B CN201910465149.XA CN201910465149A CN110175078B CN 110175078 B CN110175078 B CN 110175078B CN 201910465149 A CN201910465149 A CN 201910465149A CN 110175078 B CN110175078 B CN 110175078B
- Authority
- CN
- China
- Prior art keywords
- task
- resource
- processing
- subtasks
- service
- 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.)
- Active
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/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
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- 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/5061—Partitioning or combining of resources
- G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
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)
- Multi Processors (AREA)
Abstract
The invention discloses a service processing method and a service processing device. The method comprises the following steps: acquiring at least one service task, and generating a plurality of task resource pieces corresponding to the service task aiming at each service task; respectively allocating the plurality of task resource slices to corresponding task processing nodes so that the task processing nodes can obtain and process corresponding subtasks by using the allocated task resource slices; and when the invalid occupation time of the task resource piece of any task processing node reaches a preset threshold value, recovering the task resource piece released by the task processing node. According to the scheme, a plurality of task resource pieces corresponding to the business task are generated, and the task resource pieces are utilized to process the subtasks, so that fine-grained split of the business task execution process can be realized, and effective utilization of system resources is facilitated; and when the preset conditions are met, the task resource pieces released by the task processing nodes are recovered, so that the waste of system resources is effectively avoided.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a service processing method and a service processing device.
Background
With the rapid development of science and society, the appearance of various business systems brings great convenience to the work and life of people. When the traffic volume required to be processed by the service system is large, a plurality of service nodes are required to perform service processing together, so that the processing efficiency of the service system is improved. In the process of performing service processing, task distribution is generally performed according to the type of a task (for example, publication number CN 109471710a), that is, a certain server processes a certain type of task.
In the implementation process, the inventor finds that the existing implementation mode has the following defects: the service volume corresponding to the service system dynamically changes with time, and when the service volume of a certain type of task is less, the server corresponding to the type of task is idle for a long time, so that the waste of system resources is caused.
Disclosure of Invention
In view of the above, the present invention is proposed in order to provide a service processing method and apparatus that overcomes or at least partially solves the above problems.
According to an aspect of the present invention, there is provided a service processing method, including:
acquiring at least one service task, and generating a plurality of task resource pieces corresponding to the service task aiming at each service task;
respectively allocating the plurality of task resource slices to corresponding task processing nodes so that the task processing nodes can obtain and process corresponding subtasks by using the allocated task resource slices;
and when the invalid occupation time of the task resource piece of any task processing node reaches a preset threshold value, recovering the task resource piece released by the task processing node.
Optionally, the generating a plurality of task resource slices corresponding to the business task further includes:
determining the number of task resource pieces corresponding to the business task according to at least one task index of the business task;
and generating a plurality of task resource pieces corresponding to the business task according to the number of the task resource pieces corresponding to the business task.
Optionally, the task index includes at least one of the following indexes: the number of the subtasks to be executed corresponding to the current business task, the upper limit of the processing capacity corresponding to the current business task, and the average processing speed of the subtasks corresponding to the current business task.
Optionally, the determining, according to at least one task index of the service task, the number of task resource pieces corresponding to the service task further includes:
if the number of the subtasks to be executed corresponding to the current business task is smaller than the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the number of the subtasks to be executed corresponding to the current business task and the average processing speed of the subtasks corresponding to the current business task;
and if the number of the subtasks to be executed corresponding to the current business task is greater than or equal to the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the upper limit of the processing capacity corresponding to the current business task and the average processing speed of the subtasks corresponding to the current business task.
Optionally, the respectively allocating the plurality of task resource slices to corresponding task processing nodes further includes:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes in a polling mode.
Optionally, the respectively allocating the plurality of task resource slices to corresponding task processing nodes further includes:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes according to the priorities of the task processing nodes.
Optionally, the invalid occupation time of the task resource slice specifically includes: and the task processing node occupies the task resource piece and does not process the duration of the subtask.
Optionally, when the invalid occupied duration of the task resource slice of any task processing node reaches a preset threshold, the recovering the task resource slice released by the task processing node further includes:
and when the task resource piece of any task processing node occupies the initial point inefficiently and the time interval from the current time reaches a preset time threshold, recovering the task resource piece released by the task processing node.
Optionally, the respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes obtain and process corresponding subtasks by using the allocated task resource slices further include:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes acquire subtasks from corresponding subtask queues by using the allocated task resource slices and execute the acquired subtasks.
Optionally, if the task processing node does not acquire a subtask from the corresponding subtask queue by using the allocated task resource piece, the task processing node acquires the subtask from the corresponding subtask queue by using the allocated task resource piece again according to a preset waiting period.
According to another aspect of the present invention, there is provided a service processing apparatus, including:
the acquisition module is suitable for acquiring at least one service task;
the resource piece generating module is suitable for generating a plurality of task resource pieces corresponding to each business task;
the distribution module is suitable for respectively distributing the plurality of task resource slices to corresponding task processing nodes so that the task processing nodes can obtain and process corresponding subtasks by utilizing the distributed task resource slices;
and the recovery module is suitable for recovering the task resource pieces released by the task processing nodes when the invalid occupation time of the task resource pieces of any task processing node reaches a preset threshold value.
Optionally, the resource slice generating module is further adapted to: determining the number of task resource pieces corresponding to the business task according to at least one task index of the business task;
and generating a plurality of task resource pieces corresponding to the business task according to the number of the task resource pieces corresponding to the business task.
Optionally, the task index includes at least one of the following indexes: the number of the subtasks to be executed corresponding to the current business task, the upper limit of the processing capacity corresponding to the current business task, and the average processing speed of the subtasks corresponding to the current business task.
Optionally, the resource slice generating module is further adapted to:
if the number of the subtasks to be executed corresponding to the current business task is smaller than the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the number of the subtasks to be executed corresponding to the current business task and the average processing speed of the subtasks corresponding to the current business task;
and if the number of the subtasks to be executed corresponding to the current business task is greater than or equal to the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the upper limit of the processing capacity corresponding to the current business task and the average processing speed of the subtasks corresponding to the current business task.
Optionally, the allocation module is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes in a polling mode.
Optionally, the allocation module is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes according to the priorities of the task processing nodes.
Optionally, the invalid occupation time of the task resource slice specifically includes: and the task processing node occupies the task resource piece and does not process the duration of the subtask.
Optionally, the recycling module is further adapted to: and when the task resource piece of any task processing node occupies the initial point inefficiently and the time interval from the current time reaches a preset time threshold, recovering the task resource piece released by the task processing node.
Optionally, the allocation module is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes acquire subtasks from corresponding subtask queues by using the allocated task resource slices and execute the acquired subtasks.
Optionally, if the task processing node does not acquire a subtask from the corresponding subtask queue by using the allocated task resource piece, the task processing node acquires the subtask from the corresponding subtask queue by using the allocated task resource piece again according to a preset waiting period.
According to still another aspect of the present invention, there is provided a service processing system including: the service processing device and a plurality of task processing nodes.
According to yet another aspect of the present invention, there is provided a computing device comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the operation corresponding to the business processing.
According to another aspect of the present invention, a computer storage medium is provided, where at least one executable instruction is stored in the storage medium, and the executable instruction causes a processor to perform an operation corresponding to the service processing method.
According to the business processing method and the business processing device, at least one business task is obtained, and a plurality of task resource pieces corresponding to the business task are generated aiming at each business task; further respectively allocating the plurality of task resource slices to corresponding task processing nodes so that the task processing nodes can obtain and process corresponding subtasks by using the allocated task resource slices; and when the invalid occupation time of the task resource piece of any task processing node reaches a preset threshold value, recovering the task resource piece released by the task processing node. According to the scheme, a plurality of task resource pieces corresponding to the business task are generated, and the task resource pieces are utilized to process the subtasks, so that fine-grained split of the business task execution process is realized, and effective utilization of system resources is facilitated; and when the preset conditions are met, the task resource pieces released by the task processing nodes are recovered, so that the waste of system resources is effectively avoided, and the method has an excellent optimization effect especially for a service system with large service volume change.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is a schematic flow chart illustrating a service processing method according to an embodiment of the present invention;
fig. 2 is a schematic flow chart illustrating a service processing method according to another embodiment of the present invention;
fig. 3 is a functional structure diagram of a service processing apparatus according to an embodiment of the present invention;
FIG. 4 is a functional block diagram of a business processing system according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a computing device according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Fig. 1 is a flowchart illustrating a service processing method according to an embodiment of the present invention. The service processing method provided by this embodiment may be applied to a service system including a plurality of task processing nodes, and the service processing method provided by this embodiment may be executed by a relevant node in the service system, such as a central node, a middleware, or a non-task processing node in the service system.
As shown in fig. 1, the method includes:
step S110, at least one service task is obtained, and for each service task, a plurality of task resource pieces corresponding to the service task are generated.
Different from the prior art that a certain service task is assigned to a task processing node corresponding to the service task to be executed, in this embodiment, fine-grained splitting is performed on an execution process of the service task first, so that a plurality of task resource pieces corresponding to the service task are generated.
In a specific implementation process, at least one service task is obtained first, and the obtained service task is a service task to be subjected to task execution process optimization. For example, the acquired service tasks may be all service tasks in the service system, so as to optimize all service tasks in the service system; or, the acquired service task may be only a service task with a larger change of traffic volume in the service system, so that the effective utilization of the resources of the whole service system can be realized only by optimizing the execution process of the service task with the larger change of traffic volume. When a service task with a large change of traffic volume in a service system is acquired, historical traffic volume data corresponding to the service task can be acquired in advance, so that the traffic volume change rate of a preset time window corresponding to the service task is determined (wherein the time window can be hourly, daily, monthly and the like), and then the service task with the traffic volume change rate of the preset time window being greater than the preset change rate is determined as the service task to be acquired. The embodiment does not limit the acquired service tasks, and a person skilled in the art can select the acquired service tasks according to actual requirements.
Further, for each business task in the obtained business tasks, a plurality of task resource pieces corresponding to the business task are generated. The embodiment does not limit the specific generation manner of the plurality of task resource pieces, for example, a fixed number of task resource pieces may be generated for each business task (where the fixed number is greater than or equal to 2); and generating a number of task resource pieces matched with the relevant characteristics of each business task according to the relevant characteristics of the business task.
Step S120, respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes obtain and process corresponding subtasks by using the allocated task resource slices.
In this embodiment, one service task corresponds to a plurality of task processing nodes, and meanwhile, one task processing node may correspond to a plurality of service tasks. After generating a plurality of task resource pieces corresponding to the business task at step S110, the generated plurality of task resource pieces may be allocated to a plurality of task processing nodes corresponding to the business task. The task processing node allocated with the task resource slice can acquire the corresponding subtask by using the allocated task resource slice, and process the subtask by using the processing resource of the task processing node.
Optionally, since one task processing node may correspond to multiple service tasks, in order to avoid service processing conflicts, when multiple task resource slices are allocated to corresponding task processing nodes, multiple task resource slices may be allocated to task processing nodes that do not currently occupy any task resource slice.
Step S130, when the invalid occupation time of the task resource piece of any task processing node reaches a preset threshold, recovering the task resource piece released by the task processing node.
After the task processing node obtains the task resource slice, there is a process of occupying the task resource slice but not obtaining the corresponding subtask for execution. Therefore, in order to avoid the waste of system resources, when the invalid occupying time of the task resource piece of the task processing node reaches the preset threshold, the task processing node can automatically release the allocated task resource piece, and in this step, when the invalid occupying time of the task resource piece of one task processing node reaches the preset threshold, the task resource piece released by the task processing node can be recovered and distributed to other task processing nodes, and the task processing node releasing the task resource piece can still obtain the task resource piece corresponding to other business tasks. Therefore, the system resources are effectively utilized, and the waste of the system resources is avoided.
The implementation of steps S110 to S130 is described in detail below with a specific example:
firstly, acquiring a newly added shop task A and a newly added product task B with larger service quantity change in a service system; for each of the new store task a and the new product task B, 4 pieces of task resources a1, a2, A3, and a4 corresponding to the new store task a are generated, and 3 pieces of task resources B1, B2, and B3 corresponding to the new product task B are generated (corresponding to step S110).
Further, the task resource pieces A1, A2, A3 and A4 are respectively allocated to the task processing nodes P1, P2, P3 and P4 corresponding to the newly added shop task A; distributing the task resource slices B1, B2 and B3 to task processing nodes P5, P6 and P7 corresponding to the newly added product task B respectively; the task processing node to which the task resource piece is allocated acquires a corresponding subtask to execute using the allocated task resource piece, for example, the task processing node P1 acquires a subtask in the new store task a using the allocated task resource piece a1, where the subtask may be one or more new store requests. (corresponding to step S120.)
When the task processing node P2 does not acquire a subtask in the newly added store task a for a long time to execute during the process of occupying the task resource slice a2, the task processing node P2 releases the task resource slice a 2. The task processing node P2 may receive the task resource slice corresponding to the other business task, and at the same time, the task resource slice a2 may also be distributed to the other task processing nodes corresponding to the new shop task a. (corresponding to step S130).
Therefore, in the embodiment, for each service task, a plurality of task resource pieces corresponding to the service task are generated, and the plurality of task resource pieces are respectively allocated to corresponding task processing nodes, so that the task processing nodes acquire and process corresponding subtasks by using the allocated task resource pieces, and thus, the processing process of each service task is divided into fine granularities, which is beneficial to effective utilization of system resources; when the invalid occupation time of the task resource slice of a certain task processing node reaches a preset threshold value, the task resource slice released by the task processing node is recovered, the recovered task resource slice can be distributed to other task processing nodes which are not currently distributed with the task resource slice, and the released task resource slice can still receive the task resource slices corresponding to other business processing tasks, so that the waste of system resources is further avoided, and the effective utilization of the system resources is facilitated.
Fig. 2 is a flowchart illustrating a service processing method according to another embodiment of the present invention. The service processing method provided by this embodiment is further optimized for the embodiment shown in fig. 1. As shown in fig. 2, the method includes:
step S210, at least one service task is obtained.
The acquired service tasks can be all service tasks in the service system, and can also be only service tasks with larger change of service volume in the service system, so that the effective utilization of the resources of the whole service system can be realized only by optimizing the execution process of the service tasks with larger change of service volume.
Step S220, for each business task, determining the number of task resource pieces corresponding to the business task according to at least one task index of the business task, and generating a plurality of task resource pieces corresponding to the business task according to the number of task resource pieces corresponding to the business task.
And aiming at each acquired business task, generating a plurality of task resource pieces corresponding to the business task. In the process of generating a plurality of task resource pieces corresponding to the business task, in order to ensure that the generated task resource pieces are matched with the actual situation of the business task, the embodiment specifically generates a plurality of task resource pieces corresponding to the business task according to at least one task index of the business task.
Specifically, the number of task resource pieces corresponding to the business task is determined according to at least one task index of the business task. Wherein the task index comprises at least one of the following indexes: the number of the subtasks to be executed corresponding to the current business task, the upper limit of the processing capacity corresponding to the current business task, and the average processing speed of the subtasks corresponding to the current business task. Optionally, the number of the to-be-executed subtasks corresponding to the current service task may be an order of magnitude of the to-be-executed subtasks corresponding to the current service task, and the upper limit of the throughput corresponding to the current service task may be an upper limit of the throughput of the second level corresponding to the current service task. The task index can effectively reflect the resource requirement of the business task, so that the quantity of the task resource pieces obtained according to the task index can be matched with the actual processing requirement of the business task, efficient processing of the business task is facilitated, system resources can be effectively utilized, and resource waste is avoided.
Optionally, when the number of task resource pieces corresponding to the business task is determined according to at least one task index of the business task, the following steps are performed: firstly, judging whether the number of subtasks to be executed corresponding to the current business task is less than the upper limit of the processing capacity corresponding to the current business task; further, if the number of the to-be-executed subtasks corresponding to the current service task is less than the upper limit of the processing amount corresponding to the current service task, determining the number of the task resource pieces corresponding to the service task according to the number of the to-be-executed subtasks corresponding to the current service task and the average processing speed of the subtasks corresponding to the current service task, for example, determining the number of the task resource pieces corresponding to the service task according to the ratio of the number of the to-be-executed subtasks corresponding to the current service task to the average processing speed of the subtasks corresponding to the current service task; if the number of the subtasks to be executed corresponding to the current service task is greater than or equal to the upper limit of the processing amount corresponding to the current service task, determining the number of the task resource pieces corresponding to the service task according to the upper limit of the processing amount corresponding to the current service task and the average processing speed of the subtasks corresponding to the current service task, for example, determining the number of the task resource pieces corresponding to the service task according to the ratio of the upper limit of the processing amount corresponding to the current service task to the average processing speed of the subtasks corresponding to the current service task.
For example, if the upper limit of the processing amount corresponding to the current service task is 100 per second, the average processing speed of the subtasks corresponding to the current service task is 1/0.25 (one/s) (i.e. it is equivalent to that each subtask takes 250ms on average). If the number of the subtasks to be executed corresponding to the current business task is 1000 (greater than 100), determining that the number of the task resource pieces corresponding to the business task is 25 by taking 100/(1/0.25) ═ 25; if the number of the subtasks to be executed corresponding to the current business task is 10 (less than 100), determining that the number of the task resource pieces corresponding to the business task is 3 (rounding 2.5 and then rounding up) by taking 10/(1/0.25) ═ 2.5.
In an alternative embodiment, the number of task resource pieces corresponding to the business task and the number of single subtasks of each task resource piece may be determined according to at least one task index of the business task. And generating a plurality of task resource pieces corresponding to the business task according to the number of the task resource pieces corresponding to the business task and the number of the single subtasks of each task resource piece. Wherein the number of word subtasks may constrain the number of subtasks that a task processing node acquires at a single time.
Step S230, respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes obtain the subtasks from the corresponding subtask queues by using the allocated task resource slices, and execute the obtained subtasks.
And distributing the generated plurality of task resource pieces to the task processing nodes corresponding to the business tasks. In this embodiment, the assignment of the plurality of task resource slices to the task processing node corresponding to the service task may adopt one or more of the following assignment manners:
and in the first allocation mode, a polling mode is adopted to allocate the plurality of task resource slices to the corresponding task processing nodes respectively. Specifically, an active polling distribution mode can be adopted to sequentially distribute task resource pieces which are not distributed currently to task processing nodes which correspond to the service task and do not occupy any task resource pieces currently; or, by adopting a task processing node active polling mode, the task processing node which does not occupy any task resource piece at present actively polls the task resource piece which is not allocated, thereby realizing the allocation of the task resource piece to the corresponding task processing node. The distribution mode is simple and easy to implement, and is suitable for large-scale application and implementation.
And in the second allocation mode, the plurality of task resource slices are respectively allocated to the corresponding task processing nodes according to the priorities of the task processing nodes. Specifically, each task processing node is configured with a corresponding priority (where the priority may be determined according to the processing capability of the node), and the task resource slice is preferentially allocated to the task processing node with the higher priority, so that the resource slice is allocated according to the actual situation of each node, which is beneficial to the improvement of the service processing efficiency.
Further, after allocating a plurality of task resource pieces to corresponding task processing nodes, the task processing node to which the task resource pieces are allocated may acquire and execute a subtask from a subtask queue corresponding to the business task by using the task resource piece. The subtask queue stores subtask information for the business task, for example, if the business task is a new store task, the subtask queue stores new store subtasks corresponding to each new store request (where one new store request may correspond to one new store shop subtask).
Step S240, when the invalid occupied time of the task resource piece of any task processing node reaches a preset threshold, the task resource piece released by the task processing node is recovered.
After the task processing node allocated with the task resource slice acquires and executes the subtasks from the subtask queue corresponding to the business task by using the task resource slice, the task processing node can acquire the subtasks from the corresponding subtask queue by using the task resource slice again for execution. If the task processing node to which the task resource piece is allocated acquires and executes the subtask from the subtask queue corresponding to the service task by using the task resource piece, and the task processing node does not acquire the subtask from the corresponding subtask queue by using the allocated task resource piece due to the fact that the subtask queue does not include the subtask and the like, the task processing node may acquire the subtask from the corresponding subtask queue by using the allocated task resource piece again according to a preset waiting period. Wherein the waiting period may be matched with the number of times that the sub-task is not acquired. For example, t may be n 2(n-1)And determining each waiting period, wherein t is each waiting time, and n is the number of times that the subtasks are not acquired. For example, when the task processing node does not acquire the subtask for the first time, the task processing node waits for 1 × 2(1-1)After a unit time (which may be 1 second), the subtask is fetched again, and if the task is failed to be fetched again, 2 × 2 is waited(2-1)And performing next subtask acquisition in unit time, thereby avoiding system resource overhead caused by directly releasing task resource fragments after the task processing node fails to acquire the subtasks.
In order to avoid the waste of system resources, when the invalid occupation time of the task resource pieces reaches a preset threshold value, the task processing node releases the distributed task resource pieces. The invalid occupation time of the task resource piece is specifically the time that the task processing node occupies the task resource piece and does not process the subtask. In the specific implementation process, when the task resource piece of any task processing node occupies the initial point inefficiently and the time interval from the current time reaches the preset time threshold, the task processing node releases the distributed task resource piece, so that in the step, the task resource piece released by the task processing node can be recovered when the task resource piece of any task processing node occupies the initial point inefficiently and the time interval from the current time reaches the preset time threshold. The task resource pieces obtained by recovery can be further distributed to other service processing nodes, and the task processing node releasing the task resource pieces can also obtain the task resource pieces corresponding to other service tasks, thereby realizing the effective utilization of system resources.
In an optional implementation manner, in order to avoid that a failure of a certain server affects processing of other service tasks, the embodiment further provides corresponding service domains, where each service domain includes a plurality of service tasks, for example, a newly added domain includes a newly added store task and a newly added product service, and the like. The task processing nodes corresponding to each service task in the same service domain are the same, that is, a plurality of task processing nodes in the same service domain can acquire the task resource pieces of each service task corresponding to the service domain, so that the system resources are effectively utilized while the resource isolation is realized, and the service processing efficiency is improved.
Therefore, in the embodiment, for each service task, a plurality of task resource pieces corresponding to the service task are generated, and the plurality of task resource pieces are respectively allocated to corresponding task processing nodes, so that the task processing nodes acquire and process corresponding subtasks by using the allocated task resource pieces, and thus, the processing process of each service task is divided into fine granularities, which is beneficial to effective utilization of system resources; when the invalid occupation time of a task resource piece of a certain task processing node reaches a preset threshold value, recovering the task resource piece released by the task processing node, distributing the recovered task resource piece to other task processing nodes which are not currently distributed with the task resource piece, and still receiving the task resource piece corresponding to other business processing tasks by the released task resource piece, thereby further avoiding the waste of system resources and being beneficial to the effective utilization of the system resources; moreover, the number of the distributed task resource pieces is determined according to at least one task index of the business task, so that the generated task resource pieces are favorably matched with the actual situation of the business task, the business processing efficiency is improved, and the effective utilization of system resources is favorably realized; in addition, the task processing node can acquire the subtasks from the corresponding subtask queues by using the allocated task resource pieces again according to the preset waiting period, and system resource overhead caused by directly releasing the task resource pieces after the task processing node fails to acquire the subtasks can be avoided.
Fig. 3 is a schematic functional structure diagram of a service processing apparatus according to an embodiment of the present invention. As shown in fig. 3, the apparatus includes: an acquisition module 31, a resource slice generation module 32, an allocation module 33, and a recovery module 34.
An obtaining module 31 adapted to obtain at least one business task;
a resource slice generation module 32 adapted to generate, for each business task, a plurality of task resource slices corresponding to the business task;
the allocating module 33 is adapted to allocate the plurality of task resource slices to corresponding task processing nodes, respectively, so that the task processing nodes obtain and process corresponding subtasks by using the allocated task resource slices;
and the recovery module 34 is adapted to recover the task resource pieces released by any task processing node when the invalid occupied time of the task resource pieces of the task processing node reaches a preset threshold.
Optionally, the resource slice generating module 32 is further adapted to: determining the number of task resource pieces corresponding to the business task according to at least one task index of the business task;
and generating a plurality of task resource pieces corresponding to the business task according to the number of the task resource pieces corresponding to the business task.
Optionally, the task index includes at least one of the following indexes: the number of the subtasks to be executed corresponding to the current business task, the upper limit of the processing capacity corresponding to the current business task, and the average processing speed of the subtasks corresponding to the current business task.
Optionally, the resource slice generating module 32 is further adapted to:
if the number of the subtasks to be executed corresponding to the current business task is smaller than the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the number of the subtasks to be executed corresponding to the current business task and the average processing speed of the subtasks corresponding to the current business task;
and if the number of the subtasks to be executed corresponding to the current business task is greater than or equal to the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the upper limit of the processing capacity corresponding to the current business task and the average processing speed of the subtasks corresponding to the current business task.
Optionally, the distribution module 33 is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes in a polling mode.
Optionally, the distribution module 33 is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes according to the priorities of the task processing nodes.
Optionally, the invalid occupation duration of the task resource slice specifically is as follows: and the task processing node occupies the task resource piece and does not process the duration of the subtask.
Optionally, the recovery module 34 is further adapted to: and when the task resource piece of any task processing node occupies the initial point inefficiently and the time interval from the current time reaches a preset time threshold, recovering the task resource piece released by the task processing node.
Optionally, the distribution module 33 is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes acquire subtasks from corresponding subtask queues by using the allocated task resource slices and execute the acquired subtasks.
Optionally, if the task processing node does not acquire a subtask from the corresponding subtask queue by using the allocated task resource piece, the task processing node acquires the subtask from the corresponding subtask queue by using the allocated task resource piece again according to a preset waiting period.
The specific implementation process of each module in the apparatus of this embodiment may refer to the description of the corresponding part in the method embodiment shown in fig. 1 and/or fig. 2, which is not described herein again.
Therefore, in the embodiment, for each service task, a plurality of task resource pieces corresponding to the service task are generated, and the plurality of task resource pieces are respectively allocated to corresponding task processing nodes, so that the task processing nodes acquire and process corresponding subtasks by using the allocated task resource pieces, and thus, the processing process of each service task is divided into fine granularities, which is beneficial to effective utilization of system resources; when the invalid occupation time of the task resource slice of a certain task processing node reaches a preset threshold value, the task resource slice released by the task processing node is recovered, the recovered task resource slice can be distributed to other task processing nodes which are not currently distributed with the task resource slice, and the released task resource slice can still receive the task resource slices corresponding to other business processing tasks, so that the waste of system resources is further avoided, and the effective utilization of the system resources is facilitated.
Fig. 4 is a functional structure diagram of a service processing system according to an embodiment of the present invention. As shown in fig. 4, the system includes the service processing device 41 shown in fig. 3 and a plurality of task processing nodes.
According to an embodiment of the present invention, a non-volatile computer storage medium is provided, where at least one executable instruction is stored in the computer storage medium, and the computer executable instruction may execute the service processing method in any of the above method embodiments.
According to an embodiment of the present invention, a schematic structural diagram of a computing device is provided, and the specific embodiment of the present invention does not limit the specific implementation of the computing device.
As shown in fig. 5, the computing device may include: a processor (processor)502, a Communications Interface 504, a memory 506, and a communication bus 508.
Wherein:
the processor 502, communication interface 504, and memory 506 communicate with one another via a communication bus 508.
A communication interface 504 for communicating with network elements of other devices, such as clients or other servers.
The processor 502 is configured to execute the program 510, and may specifically perform relevant steps in the foregoing service processing method embodiment.
In particular, program 510 may include program code that includes computer operating instructions.
The processor 502 may be a central processing unit CPU, or an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits configured to implement an embodiment of the present invention. The computing device includes one or more processors, which may be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.
And a memory 506 for storing a program 510. The memory 506 may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The program 510 may specifically be used to cause the processor 502 to perform the following operations:
acquiring at least one service task, and generating a plurality of task resource pieces corresponding to the service task aiming at each service task;
respectively allocating the plurality of task resource slices to corresponding task processing nodes so that the task processing nodes can obtain and process corresponding subtasks by using the allocated task resource slices;
and when the invalid occupation time of the task resource piece of any task processing node reaches a preset threshold value, recovering the task resource piece released by the task processing node.
In an alternative embodiment, the program 510 may be specifically configured to cause the processor 502 to perform the following operations:
determining the number of task resource pieces corresponding to the business task according to at least one task index of the business task;
and generating a plurality of task resource pieces corresponding to the business task according to the number of the task resource pieces corresponding to the business task.
In an alternative embodiment, the task metrics include at least one of the following: the number of the subtasks to be executed corresponding to the current business task, the upper limit of the processing capacity corresponding to the current business task, and the average processing speed of the subtasks corresponding to the current business task.
In an alternative embodiment, the program 510 may be specifically configured to cause the processor 502 to perform the following operations:
if the number of the subtasks to be executed corresponding to the current business task is smaller than the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the number of the subtasks to be executed corresponding to the current business task and the average processing speed of the subtasks corresponding to the current business task;
and if the number of the subtasks to be executed corresponding to the current business task is greater than or equal to the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the upper limit of the processing capacity corresponding to the current business task and the average processing speed of the subtasks corresponding to the current business task.
In an alternative embodiment, the program 510 may be specifically configured to cause the processor 502 to perform the following operations:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes in a polling mode.
In an alternative embodiment, the program 510 may be specifically configured to cause the processor 502 to perform the following operations:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes according to the priorities of the task processing nodes.
In an optional implementation manner, the invalid occupation duration of the task resource slice specifically is: and the task processing node occupies the task resource piece and does not process the duration of the subtask.
In an alternative embodiment, the program 510 may be specifically configured to cause the processor 502 to perform the following operations:
and when the task resource piece of any task processing node occupies the initial point inefficiently and the time interval from the current time reaches a preset time threshold, recovering the task resource piece released by the task processing node.
In an alternative embodiment, the program 510 may be specifically configured to cause the processor 502 to perform the following operations:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes acquire subtasks from corresponding subtask queues by using the allocated task resource slices and execute the acquired subtasks.
In an alternative embodiment, the program 510 may be specifically configured to cause the processor 502 to perform the following operations:
and if the task processing node does not acquire the subtask from the corresponding subtask queue by using the allocated task resource piece, acquiring the subtask from the corresponding subtask queue by using the allocated task resource piece again according to a preset waiting period.
The algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the claims, any of the claimed embodiments may be used in any combination.
The various component embodiments of the invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that a microprocessor or Digital Signal Processor (DSP) may be used in practice to implement some or all of the functions of some or all of the components in a traffic processing apparatus and system according to embodiments of the present invention. The present invention may also be embodied as apparatus or device programs (e.g., computer programs and computer program products) for performing a portion or all of the methods described herein. Such programs implementing the present invention may be stored on computer-readable media or may be in the form of one or more signals. Such a signal may be downloaded from an internet website or provided on a carrier signal or in any other form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names.
Claims (17)
1. A service processing method comprises the following steps:
acquiring at least one service task, determining the number of task resource pieces corresponding to the service task and the single subtask number of each task resource piece according to at least one task index of the service task and generating a plurality of task resource pieces corresponding to the service task according to the number of task resource pieces corresponding to the service task and the single subtask number of each task resource piece; wherein the task index comprises the following indexes: the method comprises the following steps that the number of subtasks to be executed corresponding to a current service task, the upper limit of the processing amount corresponding to the current service task and the average processing speed of the subtasks corresponding to the current service task are calculated; if the number of the subtasks to be executed corresponding to the current business task is smaller than the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the ratio of the number of the subtasks to be executed corresponding to the current business task to the average processing speed of the subtasks corresponding to the current business task; if the number of the subtasks to be executed corresponding to the current service task is greater than or equal to the upper limit of the processing capacity corresponding to the current service task, determining the number of the task resource pieces corresponding to the service task according to the ratio of the upper limit of the processing capacity corresponding to the current service task to the average processing speed of the subtasks corresponding to the current service task;
respectively allocating the plurality of task resource slices to corresponding task processing nodes so that the task processing nodes can obtain and process corresponding subtasks by using the allocated task resource slices;
and when the invalid occupation time of the task resource piece of any task processing node reaches a preset threshold value, recovering the task resource piece released by the task processing node.
2. The method of claim 1, wherein said respectively assigning the plurality of task resource tiles to corresponding task processing nodes further comprises:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes in a polling mode.
3. The method of claim 1, wherein said respectively assigning the plurality of task resource tiles to corresponding task processing nodes further comprises:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes according to the priorities of the task processing nodes.
4. The method according to claim 1, wherein the invalid occupation duration of the task resource slice is specifically: and the task processing node occupies the task resource piece and does not process the duration of the subtask.
5. The method according to claim 4, wherein, when the invalid occupied duration of the task resource slice of any task processing node reaches a preset threshold, reclaiming the task resource slice released by the task processing node further comprises:
and when the task resource piece of any task processing node occupies the initial point inefficiently and the time interval from the current time reaches a preset time threshold, recovering the task resource piece released by the task processing node.
6. The method of claim 1, wherein the respectively allocating the plurality of task resource slices to corresponding task processing nodes for the task processing nodes to obtain and process corresponding subtasks by using the allocated task resource slices further comprises:
and respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes acquire subtasks from corresponding subtask queues by using the allocated task resource slices and execute the acquired subtasks.
7. The method according to claim 6, wherein if the task processing node does not acquire a subtask from the corresponding subtask queue using the allocated task resource piece, the task processing node acquires the subtask from the corresponding subtask queue using the allocated task resource piece again according to a preset waiting period.
8. A traffic processing apparatus, comprising:
the acquisition module is suitable for acquiring at least one service task;
the resource piece generation module is suitable for determining the number of task resource pieces corresponding to each business task and the single subtask number of each task resource piece according to at least one task index of the business task; generating a plurality of task resource pieces corresponding to the business task according to the number of the task resource pieces corresponding to the business task and the single subtask number of each task resource piece; wherein the task index comprises the following indexes: the method comprises the following steps that the number of subtasks to be executed corresponding to a current service task, the upper limit of the processing amount corresponding to the current service task and the average processing speed of the subtasks corresponding to the current service task are calculated; if the number of the subtasks to be executed corresponding to the current business task is smaller than the upper limit of the processing capacity corresponding to the current business task, determining the number of the task resource pieces corresponding to the business task according to the ratio of the number of the subtasks to be executed corresponding to the current business task to the average processing speed of the subtasks corresponding to the current business task; if the number of the subtasks to be executed corresponding to the current service task is greater than or equal to the upper limit of the processing capacity corresponding to the current service task, determining the number of the task resource pieces corresponding to the service task according to the ratio of the upper limit of the processing capacity corresponding to the current service task to the average processing speed of the subtasks corresponding to the current service task;
the distribution module is suitable for respectively distributing the plurality of task resource slices to corresponding task processing nodes so that the task processing nodes can obtain and process corresponding subtasks by utilizing the distributed task resource slices;
and the recovery module is suitable for recovering the task resource pieces released by the task processing nodes when the invalid occupation time of the task resource pieces of any task processing node reaches a preset threshold value.
9. The apparatus of claim 8, wherein the assignment module is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes in a polling mode.
10. The apparatus of claim 8, wherein the assignment module is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes according to the priorities of the task processing nodes.
11. The apparatus according to claim 8, wherein the invalid occupation duration of the task resource slice is specifically: and the task processing node occupies the task resource piece and does not process the duration of the subtask.
12. The apparatus of claim 11, wherein the recovery module is further adapted to: and when the task resource piece of any task processing node occupies the initial point inefficiently and the time interval from the current time reaches a preset time threshold, recovering the task resource piece released by the task processing node.
13. The apparatus of claim 8, wherein the assignment module is further adapted to: and respectively allocating the plurality of task resource slices to corresponding task processing nodes, so that the task processing nodes acquire subtasks from corresponding subtask queues by using the allocated task resource slices and execute the acquired subtasks.
14. The apparatus according to claim 13, wherein if the task processing node does not obtain a subtask from the corresponding subtask queue using the allocated task resource piece, the task processing node obtains a subtask from the corresponding subtask queue using the allocated task resource piece again according to a preset waiting period.
15. A business processing system comprising: a traffic processing device according to any of claims 8-14, and a plurality of task processing nodes.
16. A computing device, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is used for storing at least one executable instruction, and the executable instruction causes the processor to execute the operation corresponding to the business processing method according to any one of claims 1-7.
17. A computer storage medium having at least one executable instruction stored therein, the executable instruction causing a processor to perform operations corresponding to the business processing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910465149.XA CN110175078B (en) | 2019-05-30 | 2019-05-30 | Service processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910465149.XA CN110175078B (en) | 2019-05-30 | 2019-05-30 | Service processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110175078A CN110175078A (en) | 2019-08-27 |
| CN110175078B true CN110175078B (en) | 2020-12-01 |
Family
ID=67696737
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910465149.XA Active CN110175078B (en) | 2019-05-30 | 2019-05-30 | Service processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110175078B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111930513B (en) * | 2020-08-31 | 2023-02-28 | Oppo（重庆）智能科技有限公司 | File pre-reading adjusting method and device, electronic equipment and storage medium |
| CN113609178A (en) * | 2021-08-12 | 2021-11-05 | 深圳壹账通智能科技有限公司 | Data pushing method, device, equipment and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108833296A (en) * | 2018-04-08 | 2018-11-16 | 阿里巴巴集团控股有限公司 | The control method and device of batch processing rate |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6704765B1 (en) * | 1994-12-14 | 2004-03-09 | International Business Machines Corporation | System for allocating resources among agent processes |
| CN101136766B (en) * | 2006-11-10 | 2010-04-21 | 中兴通讯股份有限公司 | Task scheduling method for telecommunication network management system |
| US9307048B2 (en) * | 2010-12-28 | 2016-04-05 | Microsoft Technology Licensing, Llc | System and method for proactive task scheduling of a copy of outlier task in a computing environment |
| CN104580396B (en) * | 2014-12-19 | 2018-07-20 | 华为技术有限公司 | A kind of method for scheduling task, node and system |
| US10057246B1 (en) * | 2015-08-31 | 2018-08-21 | EMC IP Holding Company LLC | Method and system for performing backup operations using access tokens via command line interface (CLI) |
| US10142195B1 (en) * | 2015-09-30 | 2018-11-27 | EMC IP Holding Company LLC | Partitioned performance tracking core resource consumption independently |
| CN106843170B (en) * | 2016-11-30 | 2019-06-14 | 浙江中控软件技术有限公司 | Method for scheduling task based on token |
| CN109802895B (en) * | 2017-11-16 | 2023-01-13 | 阿里巴巴集团控股有限公司 | Data processing system, method and token management method |
| CN108647082A (en) * | 2018-04-13 | 2018-10-12 | 中国民航信息网络股份有限公司 | Task processing method, device, equipment based on token mechanism and medium |
| CN108563500A (en) * | 2018-05-08 | 2018-09-21 | 深圳市零度智控科技有限公司 | Method for scheduling task, cloud platform based on cloud platform and computer storage media |
| CN108958975B (en) * | 2018-06-29 | 2021-11-09 | 郑州云海信息技术有限公司 | Method, device and equipment for controlling data recovery speed |
-
2019
- 2019-05-30 CN CN201910465149.XA patent/CN110175078B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108833296A (en) * | 2018-04-08 | 2018-11-16 | 阿里巴巴集团控股有限公司 | The control method and device of batch processing rate |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110175078A (en) | 2019-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107038069B (en) | Dynamic label matching DLMS scheduling method under Hadoop platform | |
| EP3073374B1 (en) | Thread creation method, service request processing method and related device | |
| JP3678414B2 (en) | Multiprocessor system | |
| WO2022247105A1 (en) | Task scheduling method and apparatus, computer device and storage medium | |
| US10778807B2 (en) | Scheduling cluster resources to a job based on its type, particular scheduling algorithm,and resource availability in a particular resource stability sub-levels | |
| CN106775948B (en) | Cloud task scheduling method and device based on priority | |
| CN106569887B (en) | Fine-grained task scheduling method in cloud environment | |
| CN103150213A (en) | Method and device for balancing load | |
| CN111343288B (en) | Job scheduling method and system and computing device | |
| US10606650B2 (en) | Methods and nodes for scheduling data processing | |
| CN110175078B (en) | Service processing method and device | |
| WO2016202153A1 (en) | Gpu resource allocation method and system | |
| Xu et al. | Prophet: Scheduling executors with time-varying resource demands on data-parallel computation frameworks | |
| CN106775975B (en) | Process scheduling method and device | |
| CN110955501B (en) | Service request processing method, device, electronic equipment and readable medium | |
| CN115509704A (en) | Task scheduling method, device, equipment and storage medium | |
| CN114816709A (en) | Task scheduling method, device, server and readable storage medium | |
| CN114721818A (en) | Kubernetes cluster-based GPU time-sharing method and system | |
| CN109189581B (en) | Job scheduling method and device | |
| CN111813541B (en) | Task scheduling method, device, medium and equipment | |
| CN111831408A (en) | Asynchronous task processing method and device, electronic equipment and medium | |
| CN112486638A (en) | Method, apparatus, device and storage medium for executing processing task | |
| CN113296957B (en) | Method and device for dynamically distributing network bandwidth on chip | |
| CN112783651B (en) | Load balancing scheduling method, medium and device for vGPU of cloud platform | |
| CN113254143B (en) | Virtualized network function network element arrangement scheduling method, device 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |