CN109582449B - Wind control task grouping method and device in wind control service system and computer equipment - Google Patents
Wind control task grouping method and device in wind control service system and computer equipment Download PDFInfo
- Publication number
- CN109582449B CN109582449B CN201811261882.1A CN201811261882A CN109582449B CN 109582449 B CN109582449 B CN 109582449B CN 201811261882 A CN201811261882 A CN 201811261882A CN 109582449 B CN109582449 B CN 109582449B
- Authority
- CN
- China
- Prior art keywords
- wind control
- group
- grouping
- control task
- preset
- 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
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000012545 processing Methods 0.000 claims abstract description 24
- 238000005259 measurement Methods 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 4
- 238000000605 extraction Methods 0.000 claims description 3
- 238000001914 filtration Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000002829 reductive effect Effects 0.000 description 4
- 238000013459 approach Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000000670 limiting effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000001681 protective effect Effects 0.000 description 1
- 238000012546 transfer 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/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
-
- 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/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
Abstract
The invention discloses a method, a device and computer equipment for grouping wind control tasks in a wind control service system, wherein the method comprises the following steps: grouping objects to be grouped by using a setting algorithm, wherein the obtained grouping result meets the following conditions: the sum of the object members included in any obtained group does not exceed a preset threshold, and the number of the obtained groups is the least in all the exhaustible grouping results; performing iterative processing until a preset iteration stop condition is met by the following steps: determining a first group with the largest sum of the included object members and a second group with the smallest sum of the included object members from the current groups; determining target object members meeting preset conditions in the first group; the target object member is adapted from the first group to the second group.
Description
Technical Field
The embodiment of the specification relates to the technical field of data processing, in particular to a method, a device and computer equipment for grouping wind control tasks in a wind control service system.
Background
Currently, a grouping algorithm is involved in many application scenarios, for example, application scenarios such as resource scheduling, task execution, etc. In short, the grouping algorithm solves the following problems: the N objects to be grouped are grouped, so that the sum of object members in each group does not exceed a preset threshold, the number of the groups is as small as possible, and the groups are balanced, namely the variance among the groups is as small as possible. In order to solve the problem, an exhaustion method and a greedy algorithm are proposed in the prior art, wherein the exhaustion method exhausts all grouping results, and an optimal solution is selected from all grouping results; the greedy algorithm assigns a plurality of object members to the same group as much as possible until the sum of the object members in the group does not exceed a preset threshold.
However, the computational complexity of the exhaustive approach is high, resulting in a lower grouping efficiency; greedy algorithms, while relatively efficient with respect to the exhaustive approach, do not achieve a relative balance between packets.
Disclosure of Invention
Aiming at the technical problems, the embodiment of the specification provides a wind control task grouping method, a device and computer equipment in a wind control service system, and the technical scheme is as follows:
according to a first aspect of embodiments of the present specification, there is provided a method for grouping wind control tasks in a wind control service system, the method comprising:
grouping objects to be grouped by using a setting algorithm, wherein the obtained grouping result meets the following conditions: the sum of the object members included in any obtained group does not exceed a preset threshold, and the number of the obtained groups is the least in all the exhaustible grouping results;
performing iterative processing until a preset iteration stop condition is met by the following steps:
determining a first group with the largest sum of the included object members and a second group with the smallest sum of the included object members from the current groups;
determining target object members meeting preset conditions in the first group;
the target object member is adapted from the first group to the second group.
According to a second aspect of embodiments of the present specification, there is provided a wind control task grouping apparatus in a wind control service system, the apparatus comprising:
the initial grouping module is used for grouping objects to be grouped by using a setting algorithm, wherein the obtained grouping result meets the following conditions: the sum of the object members included in any obtained group does not exceed a preset threshold, and the number of the obtained groups is the least in all the exhaustible grouping results;
a first determining module, configured to determine, from among the current multiple groups, a first group in which a sum of object members included in the first group is the largest, and a second group in which a sum of object members included in the second group is the smallest;
a second determining module, configured to determine a target object member that meets a preset condition in the first group;
and the re-allocation module is used for allocating the target object member from the first group to the second group.
According to a third aspect of the embodiments of the present specification, there is provided a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the grouping method provided by the embodiments of the present specification when executing the program.
According to the technical scheme provided by the embodiment of the specification, the objects to be grouped are grouped by utilizing a setting algorithm, wherein the obtained grouping result meets the condition: the sum of the object members included in any obtained group does not exceed a preset threshold, and the number of the obtained groups is the least in all the exhaustible grouping results; performing iterative processing until a preset iteration stop condition is met by the following steps: the method comprises the steps of determining a first group with the largest sum of object members included in the current groups and a second group with the smallest sum of object members included in the current groups, determining a target object member meeting preset conditions in the first group, and allocating the target object member from the first group to the second group, so that a grouping result with the smallest number of groups and smallest variance among the groups can be obtained, the sum of the object members in the groups does not exceed a preset threshold, and the grouping efficiency is higher because the complexity of a grouping process is only related to the iteration times.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the embodiments of the disclosure.
Further, not all of the effects described above need be achieved in any of the embodiments of the present specification.
Drawings
In order to more clearly illustrate the embodiments of the present description or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments described in the embodiments of the present description, and other drawings may be obtained according to these drawings for a person having ordinary skill in the art.
FIG. 1 is a flowchart of an embodiment of a method for grouping wind control tasks in a wind control service system according to an exemplary embodiment of the present disclosure;
FIG. 2 is a block diagram of an embodiment of a wind-controlled task grouping device in a wind-controlled business system according to an exemplary embodiment of the present disclosure;
FIG. 3 illustrates a more specific computing device hardware architecture diagram provided by embodiments of the present description.
Detailed Description
In order for those skilled in the art to better understand the technical solutions in the embodiments of the present specification, the technical solutions in the embodiments of the present specification will be described in detail below with reference to the drawings in the embodiments of the present specification, and it is apparent that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments obtained by a person skilled in the art based on the embodiments in the present specification shall fall within the scope of protection.
Referring to fig. 1, a flowchart of an embodiment of a method for grouping wind control tasks in a wind control service system according to an exemplary embodiment of the present disclosure may include the following steps:
step 102: grouping objects to be grouped by using a setting algorithm, wherein the obtained grouping result meets the following conditions: the sum of the object members included in any of the resulting groupings does not exceed a preset threshold, and the number of resulting groupings is the least among all the exhaustible groupings.
In the embodiment of the present specification, the objects to be grouped may be grouped by a greedy algorithm, and the greedy algorithm is based on the following metrics: the sum of the object members included in any of the resulting groupings does not exceed a preset threshold, and the number of resulting groupings is the least among all the exhaustible groupings.
The "all the grouping results that can be exhausted" mentioned above refers to all the grouping results that can be exhausted by utilizing the exhaustion method on the premise that the sum of the object members included in any one of the obtained groupings does not exceed the preset threshold.
It can be seen that, based on the above metric, the grouping of the objects to be grouped by using the greedy algorithm can make the obtained grouping result satisfy the condition that "the sum of the object members included in any one of the obtained groupings does not exceed the preset threshold, and the number of the obtained groupings is the least among all the exhaustible grouping results".
Step 104: and determining a first group with the largest sum of the included object members and a second group with the smallest sum of the included object members from the current groups.
Step 106: and determining a target object member meeting a preset condition in the first group.
Step 108: the target object members are adapted from the first group to the second group.
Step 110: determining whether a preset iteration stop condition is met, and ending the flow if the preset iteration stop condition is met; if not, go back to step 104.
assume that M groups are obtained by performing step 102, and that the sum of the object members included in each of the M groups is A 1 、A 2 、A 3 、……、A m (wherein A1 to Am are arranged in order from small to large), at this time, the variances S of the M packets 0 2 Can be calculated by the following formula (I):
subsequently, assume that the sum of the object members is A k One object member n in this group is assigned to the sum of object members A j In this group, at this time, the variance S of the M groups 1 2 Relative to the above S 0 2 Variation of (2)Then it can be calculated by the following equation (two):
as can be seen from the above equation (II), if the variance is reduced after the regrouping, the variance S is also known 1 2 Less than the variance S 0 2 Then satisfy A k -A j And m is more than m.
As can be seen from the above equation (II), if the variance is reduced after the regrouping, the variance S is also known 1 2 Less than the variance S 0 2 And the Ak-Aj is more than m.
Assume again that the sum of the object members is A k One object member n in this group is assigned to the sum of object members A i In this group, where A i ＞A j And assume A i ＝A j +k (k is greater than 0), at this time, the variance S of the M packets 2 2 Relative to the above S 0 2 The variation of (c) can be calculated by the following formula (III):
combining equation (II) and equation (III) can know that the variance S 2 2 Less than the variance S 1 2 Thus, the following can be concluded: if it is desired to make the variance after regrouping as small as possible, m can be reassigned to the grouping where the sum of the object members is smallest. Based on this, in step 104, the current respective groups may be sorted in order of decreasing sum of object members included therein, a group in which the sum of object members is largest is determined, and a group in which the sum of object members is smallest is referred to as a first group and a group in which the sum of object members is smallest is referred to as a second group for convenience of description.
Subsequently, in step 106, an object member satisfying the preset condition may be determined in the first group, and for convenience of description, the object member satisfying the preset condition is referred to as a target object member, and further, in step 108, the target object member may be relocated from the first group to the second group.
Based on the above equation (II), if the variance is reduced after the regrouping, the variance S is the variance 1 2 Less than the variance S 0 2 Then satisfy A k -A j The description of > m "can be understood that, in the embodiment of the present specification, the preset condition may be: the object members are less than a specified value that is the difference between the sum of the object members included in the first group and the sum of the object members included in the second group. It follows that by reassigning one target member of the first group that satisfies the preset condition to the second group, the variance after the regrouping can be reduced.
Further, in the first group, there may be more than one object member satisfying the preset condition, in which case the smallest one of the object members satisfying the preset condition may be determined as the above-described target object member. By this processing, fine adjustment between packets can be realized, and balance between packets can be gradually improved.
Subsequently, in step 110, it is determined whether a preset iteration stop condition is satisfied, and if so, the flow may be ended, and a final grouping result is obtained; if not, the method may return to step 104, and continue to perform a round of iterative processing, that is, continue to optimize the grouping result.
In one embodiment, the iteration stop condition may be: the iteration number reaches a preset number threshold.
In another embodiment, the iteration stop condition may be: the grouping result after the current iteration processing is the same as the grouping result after the previous iteration processing, namely the grouping result is not changed any more.
According to the technical scheme provided by the embodiment of the specification, the objects to be grouped are grouped by utilizing a setting algorithm, wherein the obtained grouping result meets the condition: the sum of the object members included in any obtained group does not exceed a preset threshold, and the number of the obtained groups is the least in all the exhaustible grouping results; performing iterative processing until a preset iteration stop condition is met by the following steps: the method comprises the steps of determining a first group with the largest sum of object members included in the current groups and a second group with the smallest sum of object members included in the current groups, determining a target object member meeting preset conditions in the first group, and allocating the target object member from the first group to the second group, so that a grouping result with the smallest number of groups and smallest variance among the groups can be obtained, the sum of the object members in the groups does not exceed a preset threshold, and the grouping efficiency is higher because the complexity of a grouping process is only related to the iteration times.
As an exemplary application scenario, in a wind control service system, tasks such as feature automatic expansion, feature metadata extraction, feature metadata filtering, etc. are included, the memory resources required by different tasks when executing are different, and the memory capacity of the system is limited, so the grouping method provided by the embodiment of the present disclosure may be applied to group the tasks to be processed, so that the number of the groups is as small as possible, and the sum of the memory resources required by each task to be processed in any group does not exceed the memory capacity of the system, and the groups are balanced as much as possible. By the processing, the processing efficiency of the wind control business system on the task can be improved, and the computing resources are saved.
It will be appreciated by those skilled in the art that the above-described application of the grouping method provided in the embodiments of the present disclosure to the wind-controlled service system is merely an example, and in practical applications, the grouping method may also be applied to other application scenarios, for example, application scenarios involving resource scheduling, which are not limited in the embodiments of the present disclosure.
Corresponding to the above method embodiment, the embodiment of the present disclosure further provides a wind control task grouping device in a wind control service system, referring to fig. 2, which is a block diagram of an embodiment of the wind control task grouping device in a wind control service system provided in an exemplary embodiment of the present disclosure, where the device may include: an initial grouping module 21, a first determination module 22, a second determination module 23, and a re-allocation module 24.
Wherein, the initial grouping module 21 may be configured to group the objects to be grouped by using a setting algorithm, wherein the obtained grouping result satisfies the following conditions: the sum of the object members included in any obtained group does not exceed a preset threshold, and the number of the obtained groups is the least in all the exhaustible grouping results;
a first determining module 22, configured to determine, from among the current multiple groups, a first group having a largest sum of object members included therein and a second group having a smallest sum of object members included therein;
a second determining module 23, configured to determine, in the first group, a target object member that meets a preset condition;
a re-provisioning module 24 may be used to provision the target object member from the first group to the second group.
The initial grouping module 21 is specifically configured to:
grouping objects to be grouped by using a greedy algorithm under a preset measurement standard, wherein the measurement standard comprises the following steps: the sum of the object members included in any of the resulting groupings does not exceed a preset threshold, and the number of resulting groupings is the least among all the exhaustible groupings.
In an embodiment, the preset iteration stop condition includes one of the following:
the iteration times reach a preset time threshold;
the grouping result after the current iteration processing is the same as the grouping result after the previous iteration processing.
In an embodiment, the preset condition includes:
the object members are less than a specified value, wherein the specified value is a difference between a sum of the object members included in the first group and a sum of the object members included in the second group.
In an embodiment, the second determining module 23 includes (not shown in fig. 2):
a first determining submodule, configured to determine an object member that satisfies a preset condition in the first group;
and the second determining submodule is used for determining the minimum one of the object members meeting the preset conditions as the target object member if the object members meeting the preset conditions are more than two.
It will be appreciated that the initial grouping module 21, the first determining module 22, the second determining module 23, and the re-allocation module 24 may be configured in the apparatus as four modules with independent functions, as shown in fig. 2, or may be configured in the apparatus separately, and thus the configuration shown in fig. 2 should not be construed as limiting the embodiment of the present disclosure.
In addition, the implementation process of the functions and roles of each module in the above device is specifically shown in the implementation process of the corresponding steps in the above method, and will not be described herein again.
The embodiments of the present disclosure also provide a computer device at least including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the foregoing grouping method when executing the program. The method at least comprises the following steps: grouping objects to be grouped by using a setting algorithm, wherein the obtained grouping result meets the following conditions: the sum of the object members included in any obtained group does not exceed a preset threshold, and the number of the obtained groups is the least in all the exhaustible grouping results; performing iterative processing until a preset iteration stop condition is met by the following steps: determining a first group with the largest sum of the included object members and a second group with the smallest sum of the included object members from the current groups; determining target object members meeting preset conditions in the first group; the target object member is adapted from the first group to the second group.
FIG. 3 is a schematic diagram of a more specific hardware architecture of a computer device according to an embodiment of the present disclosure, where the device may include: a processor 310, a memory 320, an input/output interface 330, a communication interface 340, and a bus 350. Wherein the processor 310, the memory 320, the input/output interface 330 and the communication interface 340 are communicatively coupled to each other within the device via a bus 350.
The processor 310 may be implemented by a general-purpose CPU (Central Processing Unit ), a microprocessor, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc. for executing relevant programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 320 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage device, dynamic storage device, or the like. Memory 320 may store an operating system and other application programs, and when implementing the techniques provided by the embodiments of the present disclosure via software or firmware, the associated program code is stored in memory 320 and invoked for execution by processor 310.
The input/output interface 330 is used for connecting with an input/output module to realize information input and output. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.
The communication interface 340 is used to connect to a communication module (not shown in the figure) to enable communication interaction between the present device and other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).
It should be noted that although the above device only shows the processor 310, the memory 320, the input/output interface 330, the communication interface 340, and the bus 350, in the implementation, the device may further include other components necessary to achieve normal operation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the embodiments of the present description, and not all the components shown in the drawings.
The present specification embodiment also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the foregoing grouping method. The method at least comprises the following steps: grouping objects to be grouped by using a setting algorithm, wherein the obtained grouping result meets the following conditions: the sum of the object members included in any obtained group does not exceed a preset threshold, and the number of the obtained groups is the least in all the exhaustible grouping results; performing iterative processing until a preset iteration stop condition is met by the following steps: determining a first group with the largest sum of the included object members and a second group with the smallest sum of the included object members from the current groups; determining target object members meeting preset conditions in the first group; the target object member is adapted from the first group to the second group.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
From the foregoing description of embodiments, it will be apparent to those skilled in the art that the present embodiments may be implemented in software plus a necessary general purpose hardware platform. Based on such understanding, the technical solutions of the embodiments of the present specification may be embodied in essence or what contributes to the prior art in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the embodiments or some parts of the embodiments of the present specification.
The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. A typical implementation device is a computer, which may be in the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email device, game console, tablet computer, wearable device, or a combination of any of these devices.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for the device embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and reference is made to the description of the method embodiments for relevant points. The apparatus embodiments described above are merely illustrative, in which the modules illustrated as separate components may or may not be physically separate, and the functions of the modules may be implemented in the same piece or pieces of software and/or hardware when implementing the embodiments of the present disclosure. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
The foregoing is merely a specific implementation of the embodiments of this disclosure, and it should be noted that, for a person skilled in the art, several improvements and modifications may be made without departing from the principles of the embodiments of this disclosure, and these improvements and modifications should also be considered as protective scope of the embodiments of this disclosure.
Claims (7)
1. A method for grouping wind control tasks in a wind control business system, the method comprising:
grouping each wind control task to be executed by using a setting algorithm, wherein the obtained grouping result meets the following conditions: the sum of the memory resources required by the wind control task included in any obtained group does not exceed the memory capacity of the wind control service system, and the number of the obtained groups is the least in all the group results which can be exhausted; each wind control task comprises a characteristic automatic unfolding task, a characteristic metadata extraction task or a characteristic source data filtering task;
performing iterative processing until a preset iteration stop condition is met by the following steps:
determining a first group with the largest sum of memory resources required by the wind control task and a second group with the smallest sum of memory resources required by the wind control task from the current groups;
determining a target wind control task meeting preset conditions in the first group; the preset conditions include: the memory resources required by the wind control task are smaller than a specified value, wherein the specified value is a difference value between the sum of the memory resources required by the wind control task and the second group;
if the wind control tasks meeting the preset conditions are more than two, determining the minimum memory resource required in the wind control tasks meeting the preset conditions as a target wind control task;
deploying the target wind control task from the first group to the second group;
and the wind control service system executes wind control tasks in each group based on each group after the iterative processing is completed.
2. The method of claim 1, wherein grouping each wind control task to be performed using a preset algorithm comprises:
grouping each wind control task to be executed by using a greedy algorithm under a preset measurement standard, wherein the measurement standard comprises the following steps: the sum of the memory resources required by the wind control task included in any obtained group does not exceed the memory capacity of the wind control service system, and the number of the obtained groups is the least in all the exhaustible grouping results.
3. The method of claim 1, the preset iteration stop condition comprising one of:
the iteration times reach a preset time threshold;
the grouping result after the current iteration processing is the same as the grouping result after the previous iteration processing.
4. A wind control task grouping apparatus in a wind control business system, the apparatus comprising:
the initial grouping module is used for grouping all wind control tasks to be executed by using a setting algorithm, wherein the obtained grouping result meets the following conditions: the sum of the memory resources required by the wind control task included in any obtained group does not exceed the memory capacity of the wind control service system, and the number of the obtained groups is the least in all the group results which can be exhausted; each wind control task comprises a characteristic automatic unfolding task, a characteristic metadata extraction task or a characteristic source data filtering task;
the first determining module is used for determining a first group with the largest sum of memory resources required by the wind control task and a second group with the smallest sum of memory resources required by the wind control task from the current groups;
the second determining module is used for determining a target wind control task meeting a preset condition in the first group; the preset conditions include: the memory resources required by the wind control task are smaller than a specified value, wherein the specified value is a difference value between the sum of the memory resources required by the wind control task and the second group;
the second determining submodule is used for determining the smallest memory resource in the wind control tasks meeting the preset conditions as a target wind control task if the wind control tasks meeting the preset conditions are more than two;
a re-allocation module for allocating the target wind control task from the first group to the second group;
the first determining module, the second determining module and the re-allocation module are mutually matched to realize iterative processing until a preset iteration stop condition is met;
and the wind control service system executes wind control tasks in each group based on each group after the iterative processing is completed.
5. The apparatus of claim 4, the initial grouping module is specifically configured to:
grouping each wind control task to be executed by using a greedy algorithm under a preset measurement standard, wherein the measurement standard comprises the following steps: the sum of the memory resources required by the wind control task included in any obtained group does not exceed the memory capacity of the wind control service system, and the number of the obtained groups is the least in all the exhaustible grouping results.
6. The apparatus of claim 4, the preset iteration stop condition comprising one of:
the iteration times reach a preset time threshold;
the grouping result after the current iteration processing is the same as the grouping result after the previous iteration processing.
7. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any of claims 1-3 when the program is executed by the processor.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310693425.4A CN116841709A (en) | 2018-10-26 | 2018-10-26 | Wind control task grouping method and device in wind control service system and computer equipment |
| CN201811261882.1A CN109582449B (en) | 2018-10-26 | 2018-10-26 | Wind control task grouping method and device in wind control service system and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811261882.1A CN109582449B (en) | 2018-10-26 | 2018-10-26 | Wind control task grouping method and device in wind control service system and computer equipment |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310693425.4A Division CN116841709A (en) | 2018-10-26 | 2018-10-26 | Wind control task grouping method and device in wind control service system and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109582449A CN109582449A (en) | 2019-04-05 |
| CN109582449B true CN109582449B (en) | 2023-06-27 |
Family
ID=65921163
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811261882.1A Active CN109582449B (en) | 2018-10-26 | 2018-10-26 | Wind control task grouping method and device in wind control service system and computer equipment |
| CN202310693425.4A Pending CN116841709A (en) | 2018-10-26 | 2018-10-26 | Wind control task grouping method and device in wind control service system and computer equipment |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310693425.4A Pending CN116841709A (en) | 2018-10-26 | 2018-10-26 | Wind control task grouping method and device in wind control service system and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN109582449B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101288049A (en) * | 2005-05-04 | 2008-10-15 | Arm有限公司 | Use of a data engine within a data processing apparatus |
| CN101572653A (en) * | 2008-04-30 | 2009-11-04 | 株式会社Ntt都科摩 | Both-way relay method, base station, mobile terminal and relay station |
| CN104978232A (en) * | 2014-04-09 | 2015-10-14 | 阿里巴巴集团控股有限公司 | Computation resource capacity expansion method for real-time stream-oriented computation, computation resource release method for real-time stream-oriented computation, computation resource capacity expansion device for real-time stream-oriented computation and computation resource release device for real-time stream-oriented computation |
| CN106547620A (en) * | 2016-10-21 | 2017-03-29 | 杭州嘉楠耘智信息科技有限公司 | Task processing method and device |
| US9678979B1 (en) * | 2013-07-31 | 2017-06-13 | EMC IP Holding Company LLC | Common backup format and log based virtual full construction |
| CN107943568A (en) * | 2017-10-31 | 2018-04-20 | 北京航空航天大学 | Comprehensively modularized avionics system two-level scheduler model and Prototyping Platform |
| CN108205474A (en) * | 2017-08-23 | 2018-06-26 | 珠海市魅族科技有限公司 | EMS memory management process, terminal device, computer installation and readable storage medium storing program for executing |
| CN108243044A (en) * | 2016-12-27 | 2018-07-03 | 华为技术有限公司 | The method and apparatus of service deployment |
| WO2018177335A1 (en) * | 2017-03-29 | 2018-10-04 | 华为技术有限公司 | Method and device for scheduling resources |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150128149A1 (en) * | 2013-11-01 | 2015-05-07 | Theplatform, Llc | Managing Fairness In Task Bundling Of A Queue |
-
2018
- 2018-10-26 CN CN201811261882.1A patent/CN109582449B/en active Active
- 2018-10-26 CN CN202310693425.4A patent/CN116841709A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101288049A (en) * | 2005-05-04 | 2008-10-15 | Arm有限公司 | Use of a data engine within a data processing apparatus |
| CN101572653A (en) * | 2008-04-30 | 2009-11-04 | 株式会社Ntt都科摩 | Both-way relay method, base station, mobile terminal and relay station |
| US9678979B1 (en) * | 2013-07-31 | 2017-06-13 | EMC IP Holding Company LLC | Common backup format and log based virtual full construction |
| CN104978232A (en) * | 2014-04-09 | 2015-10-14 | 阿里巴巴集团控股有限公司 | Computation resource capacity expansion method for real-time stream-oriented computation, computation resource release method for real-time stream-oriented computation, computation resource capacity expansion device for real-time stream-oriented computation and computation resource release device for real-time stream-oriented computation |
| CN106547620A (en) * | 2016-10-21 | 2017-03-29 | 杭州嘉楠耘智信息科技有限公司 | Task processing method and device |
| CN108243044A (en) * | 2016-12-27 | 2018-07-03 | 华为技术有限公司 | The method and apparatus of service deployment |
| WO2018177335A1 (en) * | 2017-03-29 | 2018-10-04 | 华为技术有限公司 | Method and device for scheduling resources |
| CN108205474A (en) * | 2017-08-23 | 2018-06-26 | 珠海市魅族科技有限公司 | EMS memory management process, terminal device, computer installation and readable storage medium storing program for executing |
| CN107943568A (en) * | 2017-10-31 | 2018-04-20 | 北京航空航天大学 | Comprehensively modularized avionics system two-level scheduler model and Prototyping Platform |
Non-Patent Citations (2)
| Title |
|---|
| Jiaqiong Chen."Project selection, scheduling and resource allocation with time dependent returns".《European Journal of Operational Research》.2009,第193卷(第1期),第23-34页. * |
| 黄华."大规模云工作流模型库的高效检索方法研究".《中国博士学位论文全文数据库 信息科技辑》.2019,(2019年第07期),第I139-5页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109582449A (en) | 2019-04-05 |
| CN116841709A (en) | 2023-10-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI743458B (en) | Method, device and system for parallel execution of blockchain transactions | |
| CN109005125B (en) | Dynamic current limiting method, device and system | |
| CN107450979B (en) | Block chain consensus method and device | |
| CN111930486B (en) | Task selection data processing method, device, equipment and storage medium | |
| CN111813869B (en) | Distributed data-based multi-task model training method and system | |
| CN109614372B (en) | Object storage and reading method and device and service server | |
| CN109257758B (en) | Network capacity expansion method and device | |
| CN103763346A (en) | Distributed resource scheduling method and device | |
| CN109002357B (en) | Resource allocation method and device and Internet of things system | |
| CN111767142A (en) | Current limiting threshold setting method of service node and server side equipment | |
| CN112448984A (en) | Resource transmission method, electronic device and computer storage medium | |
| CN110637272A (en) | Dynamic maximum frequency limit for processing core group | |
| CN110020383B (en) | Page data request processing method and device | |
| CN113535721A (en) | Data writing method and device | |
| CN111050387B (en) | Base station dormancy method and device based on energy efficiency estimation, electronic equipment and medium | |
| CN110852754A (en) | Risk identification method, device and equipment | |
| CN116933886B (en) | Quantum computing execution method, quantum computing execution system, electronic equipment and storage medium | |
| CN110188975B (en) | Resource acquisition method and device | |
| CN107391541B (en) | Real-time data merging method and device | |
| CN109582449B (en) | Wind control task grouping method and device in wind control service system and computer equipment | |
| CN110995856B (en) | Method, device and equipment for server expansion and storage medium | |
| CN109901925B (en) | Task processing method and system | |
| CN113395319B (en) | Method, system, electronic device and storage medium for sensing network fault | |
| CN111427682B (en) | Task allocation method, system, device and equipment | |
| CN111931797B (en) | Method, device and equipment for identifying network to which service belongs |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200923 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20200923 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Advanced innovation technology Co.,Ltd. Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands Applicant before: Alibaba Group Holding Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |