CN113971087B - Task allocation method, device, system and computer storage medium - Google Patents
Task allocation method, device, system and computer storage medium Download PDFInfo
- Publication number
- CN113971087B CN113971087B CN202010718488.7A CN202010718488A CN113971087B CN 113971087 B CN113971087 B CN 113971087B CN 202010718488 A CN202010718488 A CN 202010718488A CN 113971087 B CN113971087 B CN 113971087B
- Authority
- CN
- China
- Prior art keywords
- graph judging
- target
- group
- graph
- workstation
- 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 75
- 238000007689 inspection Methods 0.000 claims description 90
- 238000004590 computer program Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 description 20
- 238000004891 communication Methods 0.000 description 12
- 230000005540 biological transmission Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 7
- 238000005192 partition Methods 0.000 description 5
- 230000009471 action Effects 0.000 description 3
- 238000011084 recovery Methods 0.000 description 3
- 230000008859 change Effects 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
- 238000012545 processing Methods 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 238000007792 addition Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- 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
- G06F9/5038—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 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5021—Priority
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Software Systems (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a task allocation method, a device, a system and a computer storage medium, wherein the method comprises the steps of determining a graph judging workstation in an idle state in a target group associated with target security equipment when the target security equipment generates a task to be allocated; and distributing target graph judging workstations for the tasks to be distributed according to the preset priority order of the graph judging workstations in the idle state. The invention can avoid task allocation in the whole network range of the centralized graph judging system, and has the advantages of small bandwidth requirement on the backbone network of the system and suitability for the situation of limited bandwidth of the backbone network.
Description
Technical Field
The invention belongs to the technical field of security inspection, and particularly relates to a task allocation method, device and system and a computer storage medium.
Background
In a centralized graph judging system (or referred to as a "remote centralized graph judging system"), the existing task allocation modes mainly include two implementation modes of centralized allocation and distributed allocation.
The centralized distribution is realized by a special scheduling module, the scheduling module is connected with all security check devices and all graph judging workstations in the centralized graph judging system through a backbone network, and security check tasks generated by the security check devices are optimally distributed in all the graph judging workstations. In the task allocation process, huge task data needs to be transmitted in the whole network of the centralized graph judging system, the bandwidth requirement on the backbone network is high, and once the bandwidth of the backbone network is limited, the problems of transmission delay and task allocation failure can occur.
The distributed distribution selects the main node to make a unified decision by utilizing a certain rule in each distributed node of the centralized graph judging system, and generally, the main selection and decision can be completed by relying on more than half of node acknowledgements in the whole centralized graph judging system, and the problems of high requirement on the bandwidth of the backbone network of the centralized graph judging system, transmission delay and task distribution failure occur once the bandwidth of the backbone network is limited are also existed.
Disclosure of Invention
The embodiment of the invention provides a task allocation method, a device, a system and a computer storage medium, which solve the technical problems that the existing task allocation mode has higher requirement on the bandwidth of a backbone network, and transmission delay and task allocation failure are easy to occur due to the limited bandwidth of the backbone network.
In one aspect, an embodiment of the present invention provides a task allocation method, where the method includes:
When target security inspection equipment generates a task to be distributed, determining a graph judging workstation in an idle state in a target group associated with the target security inspection equipment;
And distributing target graph judging workstations for the tasks to be distributed according to the preset priority order of the graph judging workstations in the idle state.
Preferably, when the target security inspection device generates a task to be allocated, before determining the graph-judging workstation in an idle state in a target group associated with the target security inspection device, the method further comprises:
dividing security check equipment in a centralized graph judging system according to the geographical area of each security check equipment in the system and/or the network connection structure relation among the security check equipment in the system to obtain a plurality of groups;
a decision graph workstation is configured for each packet.
Preferably, the target packet includes at least one of:
Grouping the target security inspection equipment is located;
The group of the target security inspection equipment and the adjacent group of the target security inspection equipment are at least one group located in the preset area range of the group of the target security inspection equipment.
Preferably, when the target security inspection device includes at least two security inspection devices, the distributing the target graph-judging workstation for the task to be distributed according to the preset priority order of the graph-judging workstations in the idle state specifically includes:
For any one of the at least two security check devices, the following steps are respectively executed:
the tasks to be distributed generated by the tasks to be distributed are sent to a first graph judging workstation in the idle state according to the preset priority order of the graph judging workstations in the idle state in the target group, and timing is started and recorded as a first duration;
And under the condition that the task to be distributed is not processed by the first graph judging workstation and the first time length is smaller than a preset threshold value, the task to be distributed is sent to a second graph judging workstation according to the preset priority order of the graph judging workstations in the idle state in the target group.
In one embodiment, the second graph judging station comprises a graph judging station which is arranged behind the first graph judging station in priority among the graph judging stations in the idle state in the target group.
As another embodiment, before the task to be allocated is sent to the second graph judging workstation according to the preset priority order of the graph judging workstation in the idle state in the target packet, the method further includes:
Acquiring the working state of the graph judging workstation in the target group so as to determine the graph judging workstation in the idle state in the target group;
the task to be distributed is sent to a second graph judging workstation according to the preset priority order of the graph judging workstation in an idle state in the target group, and the method specifically comprises the following steps:
the task to be distributed is sent to a second graph judging workstation according to the preset priority order of the graph judging workstation in the idle state currently in the target group,
The second graph judging work station comprises a first priority ordering graph judging work station in idle state among the graph judging work stations in the target group.
Preferably, when the target packet includes a packet in which the target security inspection device is located and the adjacent packet, the priority of the graph judging workstation of the packet in which the target security inspection device is located is higher than that of the graph judging workstation in the adjacent packet.
Preferably, when the target security inspection device generates a task to be allocated, determining a graph-judging workstation in an idle state in a target group associated with the target security inspection device specifically includes:
when the target security inspection equipment generates a task to be distributed:
Determining a graph judging workstation in an idle state in a group where the target security inspection equipment is located;
And under the condition that the graph judging work stations in the idle state do not exist in the group where the target security inspection equipment is located, determining the graph judging work stations in the idle state in the adjacent group.
Preferably, the preset priority order is determined according to at least one of the following:
the distance between the graph judging workstation in the idle state and the target security inspection equipment;
the current task number allocated to the graph judging workstation in the idle state;
And the historical task number allocated to the graph judging workstation in the idle state.
In another aspect, an embodiment of the present invention provides a task allocation apparatus, where the apparatus includes:
the determining module is used for determining a graph judging workstation in an idle state in a target group associated with target security equipment when the target security equipment generates a task to be distributed;
And the distribution module is used for distributing the target graph judging work stations for the tasks to be distributed according to the preset priority order of the graph judging work stations in the idle state.
In yet another aspect, an embodiment of the present invention provides a task allocation system, including:
the system comprises target security inspection equipment, wherein the target security inspection equipment comprises at least one security inspection equipment;
A graph judging workstation;
A processor and a memory storing computer program instructions;
The processor implements the task allocation method described above when executing the computer program instructions.
In yet another aspect, an embodiment of the present invention provides a computer storage medium having stored thereon computer program instructions that, when executed by a processor, implement the task allocation method described above.
When the target security inspection equipment generates a task to be distributed, determining a graph judging workstation in an idle state in a target group associated with the target security inspection equipment, and then distributing the target graph judging workstation for the task to be distributed according to a preset priority order of the graph judging workstation. Thus, in the embodiment of the application, tasks are distributed only in the map judging workstations in the idle state corresponding to the target groups associated with the target security inspection equipment, but not in the whole network range of the whole centralized map judging system. Compared with the existing task allocation mode which needs to allocate tasks within the whole network range of the centralized graph judging system, the task allocation method only allocates tasks to be allocated, which are generated by security check equipment, within a limited range, and reduces the transmission quantity of task data in a backbone network of the system, so that the task allocation method has the advantages of small bandwidth requirement on the backbone network and suitability for the situation of limited bandwidth of the backbone network.
Drawings
In order to more clearly illustrate the technical solution of the embodiments of the present invention, the drawings that are needed to be used in the embodiments of the present invention will be briefly described, and it is possible for a person skilled in the art to obtain other drawings according to these drawings without inventive effort.
FIG. 1 schematically illustrates one of the connection modes between security inspection equipment and a graph judging workstation in a plurality of groups divided in an embodiment of the present invention;
FIG. 2 is a flow chart of a task allocation method according to an embodiment of the present invention;
FIG. 3 is a diagram of one implementation of a task allocation method provided by one embodiment of the present invention;
FIG. 4 is another implementation of a task allocation method provided by one embodiment of the present invention;
FIG. 5 is a further implementation of a task allocation method provided by an embodiment of the present invention;
FIG. 6 is a diagram of a task allocation method according to an embodiment of the present invention
FIG. 7 is a schematic diagram of a task distribution system according to another embodiment of the present invention;
fig. 8 is a schematic structural view of a task assigning device according to still another embodiment of the present invention.
Detailed Description
Features and exemplary embodiments of various aspects of the present invention will be described in detail below, and in order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings and the detailed embodiments. It should be understood that the specific embodiments described herein are merely configured to illustrate the invention and are not configured to limit the invention. It will be apparent to one skilled in the art that the present invention may be practiced without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of the invention by showing examples of the invention.
It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising" does not exclude the presence of additional identical elements in a process, method, article, or apparatus that comprises the element.
In the centralized graph judging system, the problems of high bandwidth requirement on a backbone network of the centralized graph judging system, transmission delay and task allocation failure occur once the bandwidth of the backbone network is limited exist in both a centralized allocation mode and a distributed allocation mode.
It has been found that the above problems are caused by research that tasks to be distributed need to be distributed among the scope of all graph judging workstations in the centralized graph judging system, and huge data volume has high requirement on the bandwidth of the backbone network of the system during transmission. For example, in a centralized distribution mode, task data generated by all security check devices in a centralized graph judging system are converged to a scheduling module, the scheduling module distributes the task data among the ranges of all graph judging stations in the system, and huge data volume has high bandwidth requirements on a backbone network of the system during transmission. Similarly, in the distributed allocation mode, the distributed task allocation scheduling is performed within the whole network range of the centralized graph judging system, and has higher requirements on the bandwidth of the backbone network of the system.
In order to solve the problems in the prior art, the embodiment of the invention provides a task allocation method, a device, a system and a computer storage medium. The task allocation method provided by the embodiment of the invention is first described below.
In the embodiment of the invention, all security check devices in the centralized graph judging system are grouped first. For example, 100 security check devices in the whole centralized graph judging system are divided into 10 groups, and each group comprises a certain number of security check devices. Preferably, in the embodiment of the present invention, the security check devices in the centralized graph judging system are divided according to the geographical area to which each security check device in the centralized graph judging system belongs and/or the network connection structure relationship between the security check devices in the centralized graph judging system, so as to obtain a plurality of groups. For example, according to the geographical area to which each security inspection device in the centralized graph judging system belongs, a plurality of security inspection devices belonging to one station, building or other building are all divided into one group. For another example, according to the network connection structure relationship between security inspection devices in the centralized graph judging system, the security inspection devices in a plurality of stations with physical connection in the network connection structure are divided into one group. Therefore, by the preferable grouping mode, the method has the advantages of high processing speed and short time when the task is distributed in the group later.
And grouping security check equipment in the centralized graph judging system, and configuring a graph judging workstation for each group. As a preferred way, the number of graph judging workstations in each group is preferably determined according to the number of security check devices in the group and/or the number of tasks to be distributed in the group, so that under normal passenger flow pressure, the graph judging workstations of each group can process the tasks to be distributed generated by all security check devices in the group.
In order to relieve the pressure of the graph judging work stations in the groups when the passenger flow is large, the security check equipment in each group preferably establishes communication connection with the graph judging work stations in the adjacent groups besides establishing communication connection with the graph judging work stations in the groups where the security check equipment is located. Wherein for each security device its neighboring group comprises, for example, one group or a plurality of groups within a preset area of the group in which the security device is located. In this way, for the security inspection device in each group, under the condition that the passenger flow of the group is large, or the situation that the graph judging workstations in the group are all busy, the task to be allocated can be allocated to the graph judging workstations in the idle state in the adjacent group, so that the pressure of the graph judging workstations in the group is relieved.
Fig. 1 schematically illustrates a connection between a security inspection device and a graph-judging workstation in a plurality of packets according to an embodiment of the present invention. As shown in fig. 1, the security devices in each group may be connected to the graph-determining workstation in one or more neighboring groups, e.g., the security devices within group a establish a communication connection with the graph-determining workstations of neighboring groups B, C and D, respectively, while the security devices in neighboring groups B, C and D, e.g., only group C, establish a communication connection with the graph-determining workstation of group a. That is, the security inspection device of each group may select whether to connect with a graph judging workstation of a certain adjacent group according to actual conditions, and the present invention is not limited thereto. Preferably, the security inspection device in each group is connected to the graph judging workstations of one to five adjacent groups.
As a way of establishing a communication connection, for example, each security inspection device holds configuration information of a group in which it is located and all of the judgment stations in the adjacent groups. Through the configuration information, the security inspection equipment can establish communication connection with the group where the security inspection equipment is located and the graph judging workstation in the selected adjacent group, and monitor the working state of the graph judging workstation connected with the security inspection equipment.
Fig. 2 is a flow chart of a task allocation method according to an embodiment of the present invention. As shown in fig. 2, the task allocation method includes:
step S11, when target security inspection equipment generates tasks to be distributed, determining a graph judging workstation in an idle state in a target group associated with the target security inspection equipment;
And step S12, distributing target graph judging workstations for the tasks to be distributed according to the preset priority order of the graph judging workstations in the idle state in the target group.
It should be noted that, in the embodiment of the present invention, the target security inspection device may be understood as one or more security inspection devices, and the target graph-judging workstation may be understood as one or more graph-judging workstations. That is, the target security inspection device includes at least one security inspection device, and the target graph judgment workstation includes at least one graph judgment workstation.
Fig. 3 is a diagram illustrating a task allocation method according to an embodiment of the present invention. When the target security inspection equipment generates tasks to be distributed, task distribution is firstly carried out in the graph judging work stations in the group (hereinafter referred to as 'the group') where the target security inspection equipment is located, and when no available graph judging work stations are in the group, the tasks to be distributed are distributed to the graph judging work stations in idle states in the adjacent groups of the group where the target security inspection equipment is located.
Specifically, in step S11, when the target security inspection device generates a task to be allocated, it is first determined whether there are graph-judging workstations in an idle state in the present group.
When the idle graph judging workstations exist in the group, in step S12, the target graph judging workstation is allocated to the task to be allocated according to the preset priority order of the idle graph judging workstations in the group.
As shown in fig. 3, specifically, after generating the task to be distributed, the target security inspection device executes step S31 to obtain the working state of the graph judging workstation in the group. Next, in step S32, it is determined whether or not there is a map determining workstation in an idle state in the present group based on the result obtained in step S31. When the idle state of the graph judging workstation exists in the group, step S33 is executed, wherein tasks to be distributed are sent to the first graph judging workstation according to the sequence from high to low of the preset priority of the idle state of the graph judging workstation in the group. In step S33, the first graph determining station refers to the graph determining station with the highest priority among the graph determining stations in the idle state.
Then, step S34 is performed to determine whether the task to be distributed is processed by the first graph judging workstation. And when the task to be distributed is not processed by the first graph judging workstation, executing a step S35, namely, sending the task to be distributed to the second graph judging workstation according to the preset priority order of the graph judging workstations in the idle state in the group. In step S35, the second map making station includes one or more map making stations having priorities arranged after the first map making station among the map making stations in the idle state.
Preferably, in order not to affect the distribution of the tasks to be distributed which are generated later, the embodiment of the invention limits the distribution time of each task to be distributed. For example, a threshold is set, and if the task to be allocated is not processed by any graph judging workstation when the threshold is reached, the task to be allocated is ended.
Specifically, in step S33, for example, when a task to be distributed is sent to the first graph judging workstation, a timer is started, and the first time period is recorded. After determining in step S34 that the task to be allocated is not processed by the first graph determining workstation, further performing the step of determining whether the first time period is less than a preset threshold, wherein:
Stopping distributing the task to be distributed when the first time length is greater than or equal to a preset threshold value;
And when the first time length is smaller than a preset threshold value, the task to be allocated is sent to a second graph judging workstation according to the preset priority order of the graph judging workstations in the idle state in the group.
It should be noted that, in the process of distributing the task to be distributed to the second graph judging workstations according to the preset priority order, for each graph judging workstation in the second graph judging workstations, the process is the same as that of the first graph judging workstation. Specifically, in the process of distributing the tasks to be distributed to the second graph judging workstations according to the preset priority order, for each graph judging workstation in the second graph judging workstations, the following steps are further executed:
when the task to be allocated is processed by the graph judging workstation, outputting information of successful allocation;
when the task to be distributed is not processed by the graph judging workstation, judging whether the first time length is smaller than a preset threshold value, wherein:
Stopping distributing the task to be distributed when the first time length is greater than or equal to a preset threshold value;
And when the first duration is smaller than a preset threshold value, the task to be allocated is sent to other graph judging workstations arranged behind the graph judging workstation according to the preset priority order of the graph judging workstations in the idle state in the group.
For another situation, namely, in the passenger flow peak period, all graph judging workstations in the group are in a busy state, and no graph judging workstation in an idle state is in the group. At this time, step S33' is performed in which tasks to be allocated are allocated to the graph judging workstations in the idle state within the adjacent packets.
In step S33', first, determining the graph judging station in the idle state in the adjacent group, and then distributing the target graph judging station for the task to be distributed according to the preset priority order of the graph judging stations in the idle state in the adjacent group.
The specific process of step S33' is similar to the above process of task allocation in the graph-judging workstation in the present group except that the allocation object of the task to be allocated is changed from the present group to the adjacent group, please refer to the descriptions of step S31 to step S35, and the detailed description thereof will be omitted.
Under the condition that no idle graph judging workstation exists in the group, the graph judging pressure of the graph judging workstation in the group can be relieved by distributing the tasks to be distributed to the idle graph judging workstations in the adjacent groups, and the tasks to be distributed generated by the group can be normally distributed and processed when the passenger flow rises. Through cooperative work among the groups, load balancing in a certain range in a passenger flow peak period is realized.
Fig. 4 is a diagram illustrating another implementation of a task allocation method according to an embodiment of the present invention. Unlike the embodiment shown in fig. 3, the embodiment shown in fig. 4 preferably updates the preset priority order of the intra-target-group graph judging stations according to the change of the operating states of the graph judging stations within the target group, and allocates tasks to be allocated according to the preset priority order of the intra-target-group graph judging stations updated at the latest time.
As shown in fig. 4, specifically, after the task to be allocated is not processed by the first graph determining workstation in step S44, step S45 is further included in the step of obtaining the working states of the graph determining workstations in the group to determine the graph determining workstation in the idle state currently in the group.
Then, in step S46, the task to be allocated is sent to the second graph judging workstation in order of the preset priority of the graph judging workstation currently in the idle state in the target packet from high to low.
Accordingly, it should be further noted that, in the process of distributing the task to be distributed among the second graph judging workstations according to the preset priority order, for each graph judging workstation in the second graph judging workstations, the following steps are further executed:
When the task to be distributed is not processed by the graph judging workstation, the working state of the graph judging workstation in the group is obtained to determine the graph judging workstation in the idle state currently in the group;
and sending the tasks to be distributed to the graph judging workstation with the first priority order according to the preset priority of the graph judging workstation in the idle state in the target group from high to low.
Taking the first graph judging workstation as an a graph judging workstation and the second graph judging workstation as an example, wherein the b graph judging workstation and the c graph judging workstation are included, when the task to be allocated is not processed by the a graph judging workstation, the a graph judging workstation is described as being changed from an idle state to a busy state. At this time, the working states of the graph judging stations in the target group are obtained, and the graph judging stations in the idle state are determined to be the graph judging station b and the graph judging station c in the target group. And then, sending the tasks to be distributed to the graph judging workstation with the first priority order according to the preset priority orders of the graph judging workstation b and the graph judging workstation c, and sending the tasks to be distributed to the graph judging workstation b if the priority of the graph judging workstation b is higher than that of the graph judging workstation c.
In addition, in the case that no map judging workstation in an idle state exists in the present group, step S43' is performed in which tasks to be allocated are allocated to map judging workstations in an idle state in adjacent groups.
The specific process of step S43' is similar to the process of task allocation in the graph judging workstation in the present group shown in fig. 4 except that the allocation objects of the tasks to be allocated are changed from the present group to the adjacent groups, please refer to the descriptions of step S41 to step S46, and the detailed description thereof is omitted.
Fig. 5 is a further implementation of the task allocation method provided by an embodiment of the present invention. As yet another embodiment, unlike the embodiment shown in fig. 3, in the embodiment shown in fig. 5, when the target packet includes the present group and the adjacent packet, all available map judgment stations in the idle state in the present group and the adjacent packet are ordered according to a uniform priority rule, and task allocation is performed from the map judgment station with the highest priority.
As shown in FIG. 5, step S51 is first performed to obtain the operating states of the map judging workstations in the present group and the adjacent groups. Next, in step S52, according to the result obtained in step S51, the map determining workstation in the idle state in the present group and the adjacent group is determined. And then, according to the preset priority order of the graph judging workstations in the idle state in the group and the adjacent groups from high to low, the tasks to be distributed are sent to the first graph judging workstation.
In step S53, the first graph determining station refers to the graph determining station with the highest priority among all the graph determining stations in the idle state in the group and the adjacent groups.
Then, step S54 is performed to determine whether the task to be allocated is processed by the first graph determining workstation. And when the task to be distributed is not processed by the first graph judging workstation, executing a step S55, namely, sending the task to be distributed to the second graph judging workstation according to the preset priority sequence of the graph judging workstations in the idle state in the group and the adjacent groups. In step S55, the second graph determining station is a graph determining station having priority arranged after the first graph determining station among the graph determining stations in the idle state in the present group and the adjacent groups.
Preferably, in order not to affect the distribution of the tasks to be distributed which are generated later, the embodiment of the invention limits the distribution time of each task to be distributed. For example, a threshold is set, and if the task to be allocated is not processed by any graph judging workstation when the threshold is reached, the task to be allocated is ended.
Specifically, in step S53, for example, when a task to be distributed is sent to the first graph judging workstation, a timer is started, and the first time period is recorded. After determining in step S54 that the task to be allocated is not processed by the first graph determining workstation, further performing the step of determining whether the first time period is less than a preset threshold, wherein:
Stopping distributing the task to be distributed when the first time length is greater than or equal to a preset threshold value;
And when the first time length is smaller than a preset threshold value, the task to be allocated is sent to a second graph judging workstation according to the preset priority order of the graph judging workstations in the idle state in the group and the adjacent groups.
It should be noted that, in the process of distributing the task to be distributed to the second graph judging workstations according to the preset priority order, for each graph judging workstation in the second graph judging workstations, the process is the same as that of the first graph judging workstation. Specifically, in the process of distributing the tasks to be distributed to the second graph judging workstations according to the preset priority order, for each graph judging workstation in the second graph judging workstations, the following steps are further executed:
when the task to be allocated is processed by the graph judging workstation, outputting information of successful allocation;
when the task to be distributed is not processed by the graph judging workstation, judging whether the first time length is smaller than a preset threshold value, wherein:
Stopping distributing the task to be distributed when the first time length is greater than or equal to a preset threshold value;
And when the first duration is smaller than a preset threshold value, the task to be allocated is sent to other graph judging workstations arranged behind the graph judging workstations according to the preset priority order of the graph judging workstations in the idle state in the group and the adjacent groups.
Preferably, in the embodiment shown in fig. 5, the priority of the graph judging station of the group where the target security inspection device is located is higher than that of the graph judging station in the adjacent group. Therefore, the priority of the graph judging work stations of the group is higher than that of the graph judging work stations in the adjacent groups, so that tasks to be distributed can be distributed among the graph judging work stations of the group first, and the tasks to be distributed are distributed among the graph judging work stations in the adjacent groups under the condition that the graph judging work stations of the group are not in an idle state.
Fig. 6 is a further implementation of the task allocation method provided by an embodiment of the present invention. Unlike the embodiment shown in fig. 5, the embodiment shown in fig. 6 preferably updates the preset priority order of the intra-target-group graph judging stations according to the change in the operating state of the intra-target-group graph judging stations, and allocates tasks to be allocated according to the preset priority order of the intra-target-group graph judging stations updated at the latest time.
Specifically, as shown in fig. 6, after the task to be allocated is not processed by the first graph determining workstation in step S64, step S65 is further included in the step of obtaining the working states of the graph determining workstations in the group and the adjacent group so as to determine the graph determining workstation currently in the idle state in the group and the adjacent group.
Then, in step S66, the task to be allocated is sent to the second graph judging workstation according to the preset priority of the graph judging workstation in the idle state in the current group and the adjacent group from high to low.
Accordingly, it should be further noted that, in the process of distributing the task to be distributed among the second graph judging workstations according to the preset priority order, for each graph judging workstation in the second graph judging workstations, the following steps are further executed:
When the task to be distributed is not processed by the graph judging work station, the working states of the graph judging work stations in the group and the adjacent groups are obtained so as to determine the graph judging work stations in the idle state currently in the group and the adjacent groups;
And sending the tasks to be distributed to the graph judging workstation with the first priority order according to the preset priority of the graph judging workstation in the idle state currently in the group and the adjacent groups from high to low.
Preferably, the preset priority order is determined according to at least one of the distance between the idle graph judging workstation in the target group and the target security inspection equipment, the current task number allocated to the idle graph judging workstation in the target group and the historical task number allocated to the idle graph judging workstation in the target group.
For example, as the distance between the map-judging workstation in the idle state and the target security inspection equipment is closer, the priority is higher, and as the number of the assigned current tasks or the number of the historical tasks is smaller, the priority is higher.
Fig. 7 is a schematic structural diagram of a task allocation system according to another embodiment of the present invention. As shown in fig. 7, the system includes:
A target security device 701, the target security device comprising at least one security device;
a graph judging workstation 702;
A processor 703 and a memory 704 in which computer program instructions are stored;
The processor 703, when executing the computer program instructions, implements the task allocation methods provided by embodiments of the present invention.
Preferably, both the processor 703 and the memory 704 are electronic devices carried by the target security device 701 itself.
In particular, the processor 703 may include a Central Processing Unit (CPU), or an Application SPECIFIC INTEGRATED Circuit (ASIC), or may be configured as one or more integrated circuits that implement embodiments of the present invention.
Memory 704 may include mass storage for data or instructions. By way of example, and not limitation, memory 704 may include a hard disk drive (HARD DISK DRIVE, HDD), floppy disk drive, flash memory, optical disk, magneto-optical disk, magnetic tape, or universal serial bus (Universal Serial Bus, USB) drive, or a combination of two or more of these. The memory 704 may include removable or non-removable (or fixed) media, where appropriate. Memory 704 may be internal or external to the integrated gateway disaster recovery device, where appropriate. In a particular embodiment, the memory 704 is a non-volatile solid-state memory. In a particular embodiment, the memory 704 includes Read Only Memory (ROM). The ROM may be mask programmed ROM, programmable ROM (PROM), erasable PROM (EPROM), electrically Erasable PROM (EEPROM), electrically rewritable ROM (EAROM), or flash memory, or a combination of two or more of these, where appropriate.
The processor 703 reads and executes the computer program instructions stored in the memory 704 to implement any of the task allocation methods of the above embodiments.
In one example, the task allocation system may also include a communication interface 705 and a bus 710. As shown in fig. 3, the processor 703, the memory 704, and the communication interface 705 are connected by a bus 710 and perform communication with each other.
The communication interface 705 is mainly used to implement communication between each module, device, unit and/or apparatus in the embodiments of the present invention.
Bus 710 includes hardware, software, or both that couple the components of the online data flow billing device to each other. By way of example, and not limitation, the buses may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an infiniband interconnect, a Low Pin Count (LPC) bus, a memory bus, a micro channel architecture (MCa) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a video electronics standards association local (VLB) bus, or other suitable bus, or a combination of two or more of the above. Bus 710 may include one or more buses, where appropriate. Although embodiments of the invention have been described and illustrated with respect to a particular bus, the invention contemplates any suitable bus or interconnect.
Fig. 8 is a schematic structural view of a task assigning device according to still another embodiment of the present invention. As shown in fig. 8, the task assigning device 800 includes:
A determining module 801, configured to determine, when the target security inspection device generates a task to be allocated, a graph-judging workstation in an idle state within a target packet associated with the target security inspection device;
The allocation module 802 is configured to allocate a target graph determining workstation to the task to be allocated according to a preset priority order of the graph determining workstations in the idle state.
In addition, in combination with the task allocation method in the above embodiment, the embodiment of the present invention may be implemented by providing a computer storage medium. The computer storage medium has stored thereon computer program instructions which, when executed by a processor, implement any of the task allocation methods of the above embodiments.
In summary, when the target security inspection device generates the task to be allocated, the task allocation method, device, system and computer storage medium of the embodiment of the application determine the graph judging workstation in the idle state in the target group associated with the target security inspection device, and then allocate the target graph judging workstation to the task to be allocated according to the preset priority order of the graph judging workstation. Thus, in the embodiment of the application, tasks are distributed only in the map judging workstations in the idle state corresponding to the target groups associated with the target security inspection equipment, but not in the whole network range of the whole centralized map judging system. Compared with the existing task allocation mode which needs to allocate tasks within the whole network range of the centralized graph judging system, the task allocation method only allocates tasks to be allocated, which are generated by security check equipment, within a limited range, and reduces the transmission quantity of task data in a backbone network of the system, so that the task allocation method has the advantages of small bandwidth requirement on the backbone network and suitability for the situation of limited bandwidth of the backbone network.
In addition, the following defects exist for the existing task allocation mode:
For example, the centralized allocation mode has strong dependence on the scheduling module, and if the scheduling module fails, the whole centralized graph judging system cannot work. For another example, the distributed allocation method requires that more than half of the nodes can normally work, so once the partition (the centralized graph judging system is divided into a plurality of small areas due to network faults and the like) occurs, the nodes in the areas are communicated with each other but the different areas are not communicated with each other, and the partitions of less than half of the nodes cannot normally work. Even more extreme cases, if the system breaks into multiple small partitions, it may result in each partition not functioning properly, ultimately resulting in system level paralysis. In addition, since distributed consistency needs to be ensured, after the partition is restored, a certain time is required to perform synchronization, reselection and the like between nodes, which results in a longer system restoration time.
According to the embodiment of the invention, by adopting an independent contention mode, namely, each security inspection device can independently perform task allocation according to the priority order of the graph judging workstation, each security inspection device cannot be affected by faults of other security inspection devices or scheduling modules, so that the normal task allocation of the security inspection device is not affected, and the system robustness is good.
According to the embodiment of the invention, by adopting an independent competing mode, after the nodes where any security inspection equipment is located recover from faults, the other nodes are not influenced, the recovered nodes can also immediately start to work, the fault recovery time is short, and the stability and recovery capacity of the system are improved.
It should be understood that the invention is not limited to the particular arrangements and instrumentality described above and shown in the drawings. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and shown as examples. The method processes of the present invention are not limited to the specific steps described and shown, but various changes, modifications and additions, or the order between steps may be made by those skilled in the art after appreciating the spirit of the present invention.
The functional blocks shown in the above-described structural block diagrams may be implemented in hardware, software, firmware, or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, a plug-in, a function card, or the like. When implemented in software, the elements of the invention are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine readable medium or transmitted over transmission media or communication links by a data signal carried in a carrier wave. A "machine-readable medium" may include any medium that can store or transfer information. Examples of machine-readable media include electronic circuitry, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio Frequency (RF) links, and the like. The code segments may be downloaded via computer networks such as the internet, intranets, etc.
It should also be noted that the exemplary embodiments mentioned in this disclosure describe some methods or systems based on a series of steps or devices. The present invention is not limited to the order of the above-described steps, that is, the steps may be performed in the order mentioned in the embodiments, or may be performed in a different order from the order in the embodiments, or several steps may be performed simultaneously.
In the foregoing, only the specific embodiments of the present invention are described, and it will be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the systems, modules and units described above may refer to the corresponding processes in the foregoing method embodiments, which are not repeated herein. It should be understood that the scope of the present invention is not limited thereto, and any equivalent modifications or substitutions can be easily made by those skilled in the art within the technical scope of the present invention, and they should be included in the scope of the present invention.
Claims (9)
1. A method of task allocation, the method comprising:
dividing security check equipment in a centralized graph judging system according to the geographical area of each security check equipment in the system and/or the network connection structure relation among the security check equipment in the system to obtain a plurality of groups;
Configuring a graph judging workstation for each group;
When target security inspection equipment generates a task to be distributed, determining a graph judging workstation in an idle state in a target group associated with the target security inspection equipment;
Distributing target graph judging workstations for the tasks to be distributed according to the preset priority order of the graph judging workstations in the idle state;
The target packet includes at least one of:
Grouping the target security inspection equipment is located;
the group in which the target security inspection equipment is located and the adjacent group of the group in which the target security inspection equipment is located are at least one group located in a preset area range of the group in which the target security inspection equipment is located;
When the target security inspection equipment generates a task to be distributed, determining a graph judging workstation in an idle state in a target group associated with the target security inspection equipment, wherein the graph judging workstation specifically comprises the following steps:
when the target security inspection equipment generates a task to be distributed:
Determining a graph judging workstation in an idle state in a group where the target security inspection equipment is located;
And under the condition that the graph judging work stations in the idle state do not exist in the group where the target security inspection equipment is located, determining the graph judging work stations in the idle state in the adjacent group.
2. The task allocation method according to claim 1, wherein when the target security inspection device includes at least two security inspection devices, the allocating the target graph judgment workstation for the task to be allocated according to the preset priority order of the graph judgment workstations in the idle state specifically includes:
For any one of the at least two security check devices, the following steps are respectively executed:
the tasks to be distributed generated by the tasks to be distributed are sent to a first graph judging workstation in the idle state according to the preset priority order of the graph judging workstations in the idle state in the target group, and timing is started and recorded as a first duration;
And under the condition that the task to be distributed is not processed by the first graph judging workstation and the first time length is smaller than a preset threshold value, the task to be distributed is sent to a second graph judging workstation according to the preset priority order of the graph judging workstations in the idle state in the target group.
3. The task allocation method according to claim 2, wherein the second graph judging station includes a graph judging station prioritized after the first graph judging station among the graph judging stations in an idle state within the target group.
4. The task allocation method according to claim 2, wherein before the task to be allocated is sent to the second graph judging station in the preset priority order of the graph judging stations in the idle state in the target group, the method further comprises:
Acquiring the working state of the graph judging workstation in the target group so as to determine the graph judging workstation in the idle state in the target group;
the task to be distributed is sent to a second graph judging workstation according to the preset priority order of the graph judging workstation in an idle state in the target group, and the method specifically comprises the following steps:
and sending the tasks to be distributed to a second graph judging workstation according to the preset priority sequence of the graph judging workstation currently in the idle state in the target group, wherein the second graph judging workstation comprises a first graph judging workstation with priority sequence in the graph judging workstation currently in the idle state in the target group.
5. The task allocation method according to claim 1, wherein when the target packet includes a packet in which the target security inspection device is located and the adjacent packet, a priority of a graph judging workstation of the packet in which the target security inspection device is located is higher than that of the graph judging workstation in the adjacent packet.
6. The task allocation method according to claim 1, wherein the preset priority order is determined according to at least one of:
the distance between the graph judging workstation in the idle state and the target security inspection equipment;
the current task number allocated to the graph judging workstation in the idle state;
And the historical task number allocated to the graph judging workstation in the idle state.
7. A task allocation device, the device comprising:
the determining module is used for determining a graph judging workstation in an idle state in a target group associated with target security equipment when the target security equipment generates a task to be distributed;
The allocation module is used for allocating target graph judging workstations for the tasks to be allocated according to the preset priority sequence of the graph judging workstations in the idle state;
Before determining a graph judging workstation in an idle state in a target group associated with target security equipment when the target security equipment generates a task to be distributed, dividing the security equipment in a centralized graph judging system according to a geographic area to which each security equipment belongs and/or a network connection structure relation among the security equipment in the system to obtain a plurality of groups;
Configuring a graph judging workstation for each group;
The target packet includes at least one of:
Grouping the target security inspection equipment is located;
the group in which the target security inspection equipment is located and the adjacent group of the group in which the target security inspection equipment is located are at least one group located in a preset area range of the group in which the target security inspection equipment is located;
When the target security inspection equipment generates a task to be distributed, determining a graph judging workstation in an idle state in a target group associated with the target security inspection equipment, wherein the graph judging workstation specifically comprises the following steps:
when the target security inspection equipment generates a task to be distributed:
Determining a graph judging workstation in an idle state in a group where the target security inspection equipment is located;
And under the condition that the graph judging work stations in the idle state do not exist in the group where the target security inspection equipment is located, determining the graph judging work stations in the idle state in the adjacent group.
8. A task distribution system, the system comprising:
the system comprises target security inspection equipment, wherein the target security inspection equipment comprises at least one security inspection equipment;
A graph judging workstation;
A processor and a memory storing computer program instructions;
the processor, when executing the computer program instructions, implements a task allocation method as claimed in any one of claims 1 to 6.
9. A computer storage medium having stored thereon computer program instructions which, when executed by a processor, implement the task allocation method of any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010718488.7A CN113971087B (en) | 2020-07-23 | 2020-07-23 | Task allocation method, device, system and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010718488.7A CN113971087B (en) | 2020-07-23 | 2020-07-23 | Task allocation method, device, system and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113971087A CN113971087A (en) | 2022-01-25 |
| CN113971087B true CN113971087B (en) | 2025-02-07 |
Family
ID=79585379
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010718488.7A Active CN113971087B (en) | 2020-07-23 | 2020-07-23 | Task allocation method, device, system and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113971087B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114219501B (en) * | 2022-02-22 | 2022-06-28 | 杭州衡泰技术股份有限公司 | Sample labeling resource allocation method, device and application |
| CN115169806A (en) * | 2022-06-07 | 2022-10-11 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | Scheduling method, device and system of security check judgment graph and readable storage medium |
| CN115460291B (en) * | 2022-08-23 | 2023-05-02 | 成都智元汇信息技术股份有限公司 | Inter-group scheduling method based on center configuration, center server and system |
| CN117112816B (en) * | 2023-10-20 | 2024-02-02 | 浙江啄云智能科技有限公司 | Sorting method, device, equipment and storage medium for security inspection images |
| CN117726144B (en) * | 2024-02-07 | 2024-05-07 | 青岛国彩印刷股份有限公司 | Intelligent digital printing management system and method based on data processing |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108229449A (en) * | 2018-02-23 | 2018-06-29 | 华讯方舟科技有限公司 | A kind of parallel type human body security check system |
| CN109030524A (en) * | 2018-09-04 | 2018-12-18 | 广州地铁设计研究院有限公司 | A kind of urban track traffic safety check concentration sentences drawing system |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103337003A (en) * | 2013-05-07 | 2013-10-02 | 山西太钢不锈钢股份有限公司 | Centralized scheduling method based on distributed terminal |
| CN105262960B (en) * | 2015-10-21 | 2018-05-18 | 北京中科大洋科技发展股份有限公司 | A kind of three-dimensional television signal edit methods based on Cluster Rendering |
| CN107346539A (en) * | 2016-05-06 | 2017-11-14 | 同方威视技术股份有限公司 | For sentencing method, system and the equipment of the distribution of figure task |
| CN109212618A (en) * | 2018-08-15 | 2019-01-15 | 顺丰科技有限公司 | Security check equipment and security check method |
| CN209327245U (en) * | 2018-09-04 | 2019-08-30 | 广州地铁设计研究院股份有限公司 | A kind of urban track traffic safety check concentration sentences drawing system |
| CN110337125B (en) * | 2019-04-23 | 2022-04-05 | 重庆邮电大学 | Workstation re-grouping method in 5G network |
-
2020
- 2020-07-23 CN CN202010718488.7A patent/CN113971087B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108229449A (en) * | 2018-02-23 | 2018-06-29 | 华讯方舟科技有限公司 | A kind of parallel type human body security check system |
| CN109030524A (en) * | 2018-09-04 | 2018-12-18 | 广州地铁设计研究院有限公司 | A kind of urban track traffic safety check concentration sentences drawing system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113971087A (en) | 2022-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113971087B (en) | Task allocation method, device, system and computer storage medium | |
| CN101873269B (en) | Data retransmission device and method for distributing buffer to ports | |
| US7760665B2 (en) | Selective node tracking | |
| US10237152B2 (en) | Packet loss detection method, apparatus, and system | |
| CN102932175A (en) | Node partition dividing method, device and server | |
| CN110461006B (en) | Method and device for reducing WLAN interference and terminal equipment | |
| CN113556573A (en) | Method and system for selecting push flow link | |
| CN113612685A (en) | Network optimization method, system and network equipment | |
| CN111884875A (en) | Offline device determination method and device | |
| CN110858986A (en) | Bandwidth adjusting method, device, communication equipment and computer readable storage medium | |
| CN102291844B (en) | Random access method, communication apparatus and base station | |
| CN113193996B (en) | Power optical transmission network optimization method, device, equipment and storage medium | |
| US9814052B2 (en) | Data distribution system, distribution device, terminal device, and data distribution method providing enhanced communication efficiency | |
| CN105338129B (en) | Automatic address division method, display terminal and module terminal | |
| CN117675435A (en) | Baud rate adjusting method and system | |
| CN105491674B (en) | A kind of optimization method and device of Slot selection | |
| CN105721612A (en) | Data transmission method and device | |
| US20210409343A1 (en) | Network controller | |
| CN110149708B (en) | Carrier selection method and communication equipment | |
| US8619627B2 (en) | Automatic determination of groupings of communications interfaces | |
| CN114039937B (en) | Network resource management method and related equipment | |
| CN111800300B (en) | Method and device for setting topology of airplane data network | |
| CN110621035A (en) | Beam failure recovery method, base station and user equipment | |
| CN113438708B (en) | Node selection method, electronic device and storage medium | |
| US20200374738A1 (en) | Direct link-based data transmission method and apparatus, and terminal |
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 |