CN110321202A - Task processing method and device - Google Patents
Task processing method and device Download PDFInfo
- Publication number
- CN110321202A CN110321202A CN201810272621.3A CN201810272621A CN110321202A CN 110321202 A CN110321202 A CN 110321202A CN 201810272621 A CN201810272621 A CN 201810272621A CN 110321202 A CN110321202 A CN 110321202A
- Authority
- CN
- China
- Prior art keywords
- queue
- task
- priority level
- server
- business
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Telephonic Communication Services (AREA)
Abstract
This disclosure relates to a kind of task processing method and device.Applied to the first server in server cluster, server cluster includes first server and multiple second servers, this method comprises: determining the first priority level of business side according to queue lists when receiving the task of business side's transmission；Task is added in multiple tasks queue in first task queue corresponding with the first priority level, so that second server is according to the rank of the first priority level sequence execution task.Wherein, the mark including multiple business sides and the corresponding relationship between the priority level of multiple business sides in queue lists.Task processing method and device provided by the embodiment of the present disclosure can be realized dynamic expansion, the configuration of task issued to business side, meet the execution demand for the task that business side issues it.
Description
Technical field
This disclosure relates to field of computer technology more particularly to a kind of task processing method and device.
Background technique
Server cluster just refers to many server centereds, provides one or more services for business side.It is taking
It is engaged in including a primary server and multiple from server in device cluster.Primary server is responsible for the scheduling of task and to from server
Condition monitoring, from server be responsible for execute primary server issue specific task, according to the different primary servers of task be from
The task distribution that server is adapted to.In the related technology, provided method for processing business is single, for different business side
Task cannot be handled according to the demand of business side.
Summary of the invention
In view of this, the present disclosure proposes a kind of task processing method and devices.
According to the disclosure in a first aspect, a kind of task processing method is provided, applied to first in server cluster
Server, the server cluster include first server and multiple second servers, which comprises
When receiving the task of business side's transmission, the first priority level of the business side is determined according to queue lists；
The task is added in multiple tasks queue in first task queue corresponding with first priority level,
So that second server executes the task according to the sequence of the rank of first priority level,
Wherein, the mark including multiple business sides and pair between the priority level of multiple business sides in the queue lists
It should be related to.
For the above method, in one possible implementation, the method also includes:
According to the mark of multiple business sides and the priority level of the multiple business side, queue lists are created, wherein described
The mark of multiple business sides is according to priority level from high to low tactic in queue lists；
According to putting in order for the mark of business sides multiple in the queue lists, adding in the queue lists is indicated
Multiple sequencing numbers of the priority level of multiple business sides；
Establish multiple tasks queue corresponding with multiple priority levels in the queue lists；
Each task queue is marked according to the sequencing numbers of corresponding priority level, so that the second server
According to the label of task queue, priority level corresponding to task queue is determined.
For the above method, in one possible implementation, the method also includes:
When the task of the business side received handles request, request is handled according to the task and determines the business side
Priority level；
According to priority level corresponding to the business side, the mark of the business side is added to the queue lists
In.
According to the second aspect of the disclosure, a kind of task processing method is provided, applied to second in server cluster
Server, the server cluster include first server and multiple second servers, which comprises
According to the queue lists got, determine corresponding with the multiple tasks queue of the first server multiple preferential
Rank；
It sorts according to the rank of priority level, executes the task in the multiple task queue,
Wherein, the mark including multiple business sides and pair between the priority level of multiple business sides in the queue lists
It should be related to.
It is in one possible implementation, determining with described the according to the queue lists got for the above method
The corresponding multiple priority levels of the multiple tasks queue of one server, comprising:
It is determining to be taken with described first according to the sequencing numbers for the priority level for indicating multiple business sides in the queue lists
Priority level corresponding to each task queue in the multiple tasks queue of business device,
It wherein, further include the sequencing numbers for indicating the priority level of each business side, the task in the queue lists
Queue is marked according to the sequencing numbers of corresponding priority level.
According to the third aspect of the disclosure, a kind of Task Processing Unit is provided, applied to first in server cluster
Server, the server cluster include first server and multiple second servers, and described device includes:
First level determining module determines the business according to queue lists when receiving the task of business side's transmission
First priority level of side；
The task is added in multiple tasks queue corresponding with first priority level by task allocating module
In one task queue, so that second server executes the task according to the sequence of the rank of first priority level,
Wherein, the mark including multiple business sides and pair between the priority level of multiple business sides in the queue lists
It should be related to.
For above-mentioned apparatus, in one possible implementation, described device further include:
List creating module creates queue according to the mark of multiple business sides and the priority level of the multiple business side
List, wherein the mark of multiple business sides is according to priority level from high to low tactic in the queue lists；
Number adding module, according to putting in order for the mark of business sides multiple in the queue lists, in the queue
Addition indicates multiple sequencing numbers of the priority level of multiple business sides in list；
Module is established in queue, establishes multiple tasks queue corresponding with multiple priority levels in the queue lists；
Queue mark module is marked each task queue according to the sequencing numbers of corresponding priority level, so that
The second server determines priority level corresponding to task queue according to the label of task queue.
For above-mentioned apparatus, in one possible implementation, described device further include:
It is true to handle request according to the task when the task of the business side received handles request for request receiving module
The priority level of the fixed business side；
The mark of the business side is added to by mark adding module according to priority level corresponding to the business side
In the queue lists.
According to the fourth aspect of the disclosure, a kind of Task Processing Unit is provided, applied to second in server cluster
Server, the server cluster include first server and multiple second servers, and described device includes:
Second level determining module, according to the queue lists got, the determining multiple tasks with the first server
The corresponding multiple priority levels of queue；
Task execution module sorts according to the rank of priority level, executes the task in the multiple task queue,
Wherein, the mark including multiple business sides and pair between the priority level of multiple business sides in the queue lists
It should be related to.
For above-mentioned apparatus, in one possible implementation, the second level determining module, comprising:
Rank determines submodule, according to the sequencing numbers for the priority level for indicating multiple business sides in the queue lists,
Priority level corresponding to each task queue in the determining multiple tasks queue with the first server,
It wherein, further include the sequencing numbers for indicating the priority level of each business side, the task in the queue lists
Queue is marked according to the sequencing numbers of corresponding priority level.
According to the 5th of the disclosure the aspect, a kind of Task Processing Unit is provided, comprising: processor；It is handled for storage
The memory of device executable instruction；Wherein, the processor is configured to executing at the above-mentioned task applied to first server
Reason method.
According to the 6th of the disclosure the aspect, a kind of non-volatile computer readable storage medium storing program for executing is provided, is stored thereon with
Computer program instructions, wherein the computer program instructions are realized above-mentioned applied to first server when being executed by processor
Task processing method.
According to the 7th of the disclosure the aspect, a kind of Task Processing Unit is provided, comprising: processor；It is handled for storage
The memory of device executable instruction；Wherein, the processor is configured to executing at the above-mentioned task applied to second server
Reason method.
According to the eighth aspect of the disclosure, a kind of non-volatile computer readable storage medium storing program for executing is provided, is stored thereon with
Computer program instructions, wherein the computer program instructions are realized above-mentioned applied to second server when being executed by processor
Task processing method.
Task processing method and device provided by the embodiment of the present disclosure can make first server according to priority level pair
The task of the transmission of business side is allocated, and make second server according to the rank of the first priority level sort execution task,
Dynamic expansion, the configuration that can be realized task issued to business side, meet the execution demand for the task that business side issues it.
According to below with reference to the accompanying drawings to detailed description of illustrative embodiments, the other feature and aspect of the disclosure will become
It is clear.
Detailed description of the invention
Comprising in the description and constituting the attached drawing of part of specification and specification together illustrates the disclosure
Exemplary embodiment, feature and aspect, and for explaining the principles of this disclosure.
Fig. 1 shows the flow chart of the task processing method according to one embodiment of the disclosure；
Fig. 2 shows the flow charts according to the task processing method of one embodiment of the disclosure；
Fig. 3 shows the schematic diagram of queue lists in the task processing method according to one embodiment of the disclosure；
Fig. 4 shows the flow chart of the task processing method according to one embodiment of the disclosure；
Fig. 5 a- Fig. 5 d shows the schematic diagram of the queue lists in the task processing method according to one embodiment of the disclosure；
Fig. 6 shows the flow chart of the task processing method according to one embodiment of the disclosure；
Fig. 7 shows the flow chart of the task processing method according to one embodiment of the disclosure；
Fig. 8 shows the schematic diagram of the application scenarios of the task processing method according to one embodiment of the disclosure；
Fig. 9 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure；
Figure 10 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure；
Figure 11 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure；
Figure 12 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure；
Figure 13 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure.
Specific embodiment
Various exemplary embodiments, feature and the aspect of the disclosure are described in detail below with reference to attached drawing.It is identical in attached drawing
Appended drawing reference indicate element functionally identical or similar.Although the various aspects of embodiment are shown in the attached drawings, remove
It non-specifically points out, it is not necessary to attached drawing drawn to scale.
Dedicated word " exemplary " means " being used as example, embodiment or illustrative " herein.Here as " exemplary "
Illustrated any embodiment should not necessarily be construed as preferred or advantageous over other embodiments.
In addition, giving numerous details in specific embodiment below to better illustrate the disclosure.
It will be appreciated by those skilled in the art that without certain details, the disclosure equally be can be implemented.In some instances, for
Method, means, element and circuit well known to those skilled in the art are not described in detail, in order to highlight the purport of the disclosure.
Fig. 1 shows the flow chart of the task processing method according to one embodiment of the disclosure.As shown in Figure 1, this method application
First server in server cluster, server cluster may include first server and multiple second servers.The party
Method may include step S11 and step S12.
In step s 11, when receiving the task of business side's transmission, the first of the business side is determined according to queue lists
Priority level.It wherein, may include between the mark of multiple business sides and the priority level of multiple business sides in queue lists
Corresponding relationship.
In the present embodiment, first server can be the primary server in server cluster, and second server can be
Slave server in server cluster.Business side can be the user serviced provided by the server clusters such as website, platform
Or service object, business side can issue the executable task of server cluster by corresponding server, terminal etc..This field
Technical staff can according to actual needs be configured business side, the disclosure to this with no restriction.The mark of business side can be with
It is the mark that title, the number etc. of business side itself can characterize the identity characteristic of the business side, can also be first server
For the distribution of business side can by marks such as number, serial numbers that the business side and other business sides distinguish, the disclosure to this not
It is restricted.
In the present embodiment, the priority level of business side can be according to business side it needs to be determined that, can also be root
The information relevant to task such as type according to task transmitted by business side determines.Different business side can correspond to identical excellent
First rank can also correspond to different priority levels.For example, business side 5 and business side 6 can correspond to identical priority level 8.
Business side 5 and business side 6 can also respectively correspond priority level 3 and priority level 9.The different task of the same business side can be with
Corresponding to a priority level, different priority levels can also be corresponded to.For example, it may be the task 1 and task 2 of business side 1
The corresponding same priority level 4.The corresponding priority level of task 1 that can also be business side 1 is priority level 6, business side 1
The corresponding priority level of task 2 is priority level 7.Those skilled in the art can be according to actual needs to business side, business side
Task and priority level between corresponding relationship be configured, the disclosure to this with no restriction.
It in one possible implementation, can be directly by industry when the priority level corresponding to the business side is one
Priority level corresponding to business side is determined as the first priority level.It, can be with when the priority level corresponding to the business side is multiple
According to the relevant information of task, priority level corresponding to the task is determined as the first priority level.Then, task is added
Into multiple tasks queue in first task queue corresponding with the first priority level, so that second server is preferential according to first
The rank sequence execution task of rank.
In the present embodiment, the relevant information of task may include the information relevant to the task such as type of task.This
Field technical staff can according to actual needs be configured information relevant to task, the disclosure to this with no restriction.
In step s 12, task is added to first task corresponding with the first priority level team in multiple tasks queue
In column, so that second server is according to the rank of the first priority level sequence execution task.
In the present embodiment, after the first priority level corresponding to business side has been determined, from multiple tasks queue
The first task queue that priority level is the first priority level is obtained, which is added in first task queue.In this way, the
Two servers can sort according to rank of first priority level in all priority levels and execute the task.For example, first is excellent
Rank of the first rank Y3 in all priority levels is ordered as third, then the other rank row of the preferential execution priority of second server
The task in task queue that sequence is first, second, task is performed both by after completion wherein, executes the first priority level Y3's
Task in task queue, to realize that preferential executive level sorts the purpose of the task in preceding task queue.
In the present embodiment, queue lists and multiple tasks queue can store in first server, pass through the first clothes
Business device creation queue lists and corresponding multiple tasks queue.It may include list and queue creation module in first server.
List and queue creation module can be realized by technologies such as message queues (Message Queue, abbreviation MQ) queue lists and
The creation and maintenance of corresponding multiple tasks queue, and when queue lists and corresponding multiple tasks queue change, immediately
Ground by after variation queue lists and corresponding multiple tasks queue be sent to second server and report to first server
Itself, realizes the dynamic configuration of being issued based on business side for task.Those skilled in the art can be according to actual needs to team
The foundation of column list and task queue is configured, the disclosure to this with no restriction.
Task processing method provided by the embodiment of the present disclosure, when receiving the task of business side's transmission, according to queue
List determines the first priority level of business side.Task is added to corresponding with the first priority level in multiple tasks queue
In one task queue, so that second server is according to the rank of the first priority level sequence execution task.It can make first service
Device is allocated according to task of the priority level to the transmission of business side, and makes second server according to the grade of the first priority level
Not Pai Xu execution task, can be realized task issued to business side dynamic expansion, configuration, meet what business side issued it
The execution demand of task.
Fig. 2 shows the flow charts according to the task processing method of one embodiment of the disclosure.Fig. 3 shows real according to the disclosure one
Apply the schematic diagram of queue lists in the task processing method of example.As shown in Fig. 2, this method can also be including step S13 to step
S16。
In step s 13, according to the mark of multiple business sides and the priority level of multiple business sides, queue lists are created.
Wherein, the mark of multiple business sides is according to priority level from high to low tactic in queue lists.
In the present embodiment, the corresponding priority level of the mark of each business side of queue lists is corresponding.Such as Fig. 3 institute
Show, it is preferential corresponding to business side in queue lists when the task that business side is issued corresponds to identical priority level
Rank is one, for example, business side 1 and business side 2.When the task that the same business side is issued corresponds to different priority levels
When, as shown in figure 3, in queue lists priority level corresponding to business side be it is multiple, and business side issue different task
Corresponding different priority level.For example, business side 3, which issues first task, corresponds to priority level 3, business side 3 issues the second task
Corresponding priority level 4.When different business Fang Jun corresponds to identical priority level, in queue lists corresponding to different business side
Priority level be one.Those skilled in the art can according to actual needs be configured priority level, and the disclosure is to this
With no restriction.
In step S14, according to putting in order for the mark of business sides multiple in queue lists, added in queue lists
Indicate multiple sequencing numbers of the priority level of multiple business sides.
In the present embodiment, can in queue lists position corresponding with priority level, add its corresponding sequence and compile
Number.Serial number, the digital number etc. that sequencing numbers can be first server and second server is accepted, for example, such as Fig. 3 institute
Show, sequencing numbers can be 1,2,3 and 4, and sequencing numbers can also be a, b, c and d, the disclosure to this with no restriction.
In step S15, multiple tasks queue corresponding with multiple priority levels in queue lists is established.
In the present embodiment, corresponding task queue is established for each of queue lists priority level, so that each
The task of a priority level can be added in corresponding task queue, realize the task distribution based on priority level.
In step s 16, each task queue is marked according to the sequencing numbers of corresponding priority level, so that the
Two servers determine priority level corresponding to task queue according to the label of task queue.
In the present embodiment, the sequencing numbers of corresponding priority level can be added in the title of task queue, for example,
The entitled biz of certain task queue, the sequencing numbers of corresponding priority level are 2, sequencing numbers 2 can be added to task team
In the title of column.The entitled biz-2 of task queue after the label of acquisition, can be true according to the title biz-2 of task queue
Its fixed corresponding priority level and rank sequence.Being also based on corresponding sequencing numbers is that label etc. is added in task queue.
Those skilled in the art can according to actual needs to according to the sequencing numbers of corresponding priority level to each task queue into
The mode of line flag is configured, the disclosure to this with no restriction.
Fig. 4 shows the flow chart of the task processing method according to one embodiment of the disclosure.This method can also include step
S17 and step S18.
In step S17, when the task of the business side received handles request, is handled according to task and request to determine business
The priority level of side.
It in the present embodiment, can be according to type, quantity of business side's task etc. and the task of business side and business side
Relevant information itself determines the priority level of business side, the disclosure to this with no restriction.
In step S18, the mark of business side is added to queue lists by the priority level according to corresponding to business side
In.
In the present embodiment, the putting in order in queue lists of the priority level according to corresponding to business side, is added
It is added in queue lists, making the mark of multiple business sides in the queue lists for the mark for adding the business side is still according to priority
Not from high to low tactic.Fig. 5 a- Fig. 5 d shows the queue in the task processing method according to one embodiment of the disclosure
The schematic diagram of list.Newly-increased business side 4 is added to before queue lists, business side included in queue lists and its correspondence
Priority level, sequencing numbers it is as shown in Figure 5 a.When the priority level in newly-increased business side 4 is highest as shown in Figure 5 b, directly
Connect the first place that the mark 004 of business side 4 is added to queue lists.As shown in Figure 5 c, in the priority level of newly-increased business side 4
When being minimum, the mark 004 of business side 4 is directly added to the last bit of queue lists.As fig 5d, in newly-increased business side
4 priority level be middle position sequence when, directly by the mark 004 of business side 4 be added in queue lists it is corresponding in
Between position.After newly-increased business side 4 is added in queue lists, priority level therein and sequencing numbers are adapted to
Modification.
In the present embodiment, first server can also be modified according to the priority level of business side and be requested, and be existed to business side
It modifies the position where mark in queue lists.It is requested being modified according to priority level, determines that the demand of business side is
The priority level for reducing the task of its sending is to delete the mark of business side in current queue list, and according to business after modification
The mark of business side is added in queue lists by the priority level of side.First server can be modified according to the demand of business side
Its position in queue lists, to meet the needs of business side.
In this way, it is ensured that the mark of multiple business sides is always according to priority level by height in queue lists
To low tactic, dynamic expansion of the realization to queue lists, point of the task of the realization other business side of different priorities
Match and executes.
Fig. 6 shows the flow chart of the task processing method according to one embodiment of the disclosure.This method is applied to server set
Second server in group, server cluster includes first server and multiple second servers.As shown in fig. 6, this method can
To include step S21 and step S22.
In the step s 21, according to the queue lists got, determination is corresponding with the multiple tasks queue of first server
Multiple priority levels.Wherein, identifying between the priority level of multiple business sides including multiple business sides in queue lists
Corresponding relationship.
In the present embodiment, queue lists can be obtained from first server.It can be according to the excellent of corresponding business side
Task queue is marked in the information of the characterization priority level of the sequencing numbers of first rank etc. so that second server according to appoint
The label of business queue determines its corresponding priority level, the disclosure to this with no restriction.
In the present embodiment, the corresponding priority level of the mark of each business side of queue lists is corresponding.Such as Fig. 3 institute
Show, it is preferential corresponding to business side in queue lists when the task that business side is issued corresponds to identical priority level
Rank is one.When the task that the same business side is issued corresponds to different priority levels, as shown in figure 3, being arranged in queue
Priority level corresponding to business side is multiple in table, and the different task that business side issues corresponds to different priority levels.
In step S22, sorts according to the rank of priority level, execute the task in multiple tasks queue.
In the present embodiment, it can sort according to the rank of priority level, exist in preferential execution multiple tasks queue etc.
Pending task and rank sort preceding task.For example, existing in task queue 1, task queue 3 and task queue 5
Etc. pending task, in the rank sequence for determining priority level corresponding to task queue 1, task queue 3 and task queue 5
When for task queue 1 > task queue, 3 > task queue 5, preferential executing in task queue 1 for task.
Task processing method provided by the embodiment of the present disclosure, according to the queue lists got, determining and first service
The corresponding multiple priority levels of the multiple tasks queue of device.It sorts, is executed in multiple tasks queue according to the rank of priority level
Task.Dynamic expansion, the configuration that can be realized task issued to business side, so that second server can satisfy business side
The execution demand for the task that it is issued.
Fig. 7 shows the flow chart of the task processing method according to one embodiment of the disclosure.As shown in fig. 7, step S21 can be with
Including step S211.
In step S211, according to the sequencing numbers for the priority level for indicating multiple business sides in queue lists, determine with
Priority level corresponding to each task queue in the multiple tasks queue of first server.Wherein, further include in queue lists
Indicate the sequencing numbers of the priority level of each business side, task queue is marked according to the sequencing numbers of corresponding priority level
Note.
Wherein, the addition manner of sequencing numbers, type, and according to the sequencing numbers of corresponding priority level to task queue
The implementation being marked can refer to the associated description of step S14 and step S16.
In this way, priority level corresponding to task queue and preferential can be determined simply and rapidly according to sequencing numbers
The rank of rank sorts.
It should be noted that although using above-mentioned as above, the those skilled in the art that as example describes task processing method
Member it is understood that the disclosure answer it is without being limited thereto.In fact, user completely can be according to personal preference and/or practical application scene spirit
It is living to set each step, as long as meeting the technical solution of the disclosure.
Using example
Below in conjunction with " task processes of certain server cluster " property application scenarios as an example, provide according to this
The application example of open embodiment, in order to understand the process of task processing method.It will be understood by those skilled in the art that answering below
With example merely for the sake of the purpose for being easy to understand the embodiment of the present disclosure, it is not construed as the limitation to the embodiment of the present disclosure.
Fig. 8 shows the schematic diagram of the application scenarios of the task processing method according to one embodiment of the disclosure.As shown in figure 8,
Process using the carry out task processing of above-mentioned task processing method is as follows:
The course of work of first server includes list and queue creation, task distribution.It is specific as follows:
List and queue creation, comprising: according to the mark of multiple business sides and the priority level of multiple business sides, create team
Column list.Wherein, the mark of multiple business sides is according to priority level from high to low tactic in queue lists.According to
The marks of multiple business sides puts in order in queue lists, and addition indicates the priority level of multiple business sides in queue lists
Multiple sequencing numbers.For example, 1,2,3 and 4.Establish multiple tasks team corresponding with multiple priority levels in queue lists
Column.Each task queue is marked according to the sequencing numbers of corresponding priority level.For example, the multiple tasks team after label
The title of column is respectively task queue 1, task queue 2, task queue 3 and task queue 4.Number in task queue title is
For the sequencing numbers of priority level corresponding to task queue.
It is receiving when the processing request of the task of the business side received, is being handled according to task and request to determine business side
The mark of business side is added in the queue lists by priority level, the priority level according to corresponding to business side.
Task distribution, comprising: when receiving the task of business side's transmission, determine the first of business side according to queue lists
Task is added in multiple tasks queue in first task queue corresponding with the first priority level by priority level.For example, working as
When receiving the task 1 ' of the sending of business side 1, since the priority level of business side 1 is priority level 1, and priority level 1 is corresponded to
Sequencing numbers be 1, then by task 1 ' be added to corresponding task queue 1 (task queue 1 is the title of task queue, wherein
" 1 " is sequencing numbers) in.
The course of work of each first server in multiple first servers, comprising: according to the queue lists got, really
Fixed multiple priority levels corresponding with the multiple tasks queue of first server sort according to the rank of priority level, execute more
Task in a task queue.For example, the sequencing numbers according to included in task queue title determine the excellent of the task queue
The rank of first rank sorts are as follows: 1 > task queue of task queue, 2 > task queue, 3 > task queue 4.When task queue 2 and appoint
It is engaged in queue 3 there are when task, preferential executing in task queue 2 for task, the task in task queue 2 all executes completion
And then the task in execution task queue 3.
In this way, first server can be made to be allocated according to task of the priority level to the transmission of business side, and make
According to the rank of the first priority level sequence execution task, the dynamic that can be realized task issued to business side expands two servers
Exhibition, configuration, meet the execution demand for the task that business side issues it.
Fig. 9 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure.As shown in figure 9, the device is applied to
First server in server cluster, server cluster may include first server and multiple second servers.The device
It may include first level determining module 51 and task allocating module 52.The first level determining module 51 is configured as when reception
To business side send task when, the first priority level of business side is determined according to queue lists.52 quilt of task allocating module
It is configured to be added to task in multiple tasks queue in first task queue corresponding with the first priority level, so that the second clothes
Device be engaged according to the rank of the first priority level sequence execution task.Wherein, in queue lists including multiple business sides mark with
Corresponding relationship between the priority level of multiple business sides.
Figure 10 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure.
In one possible implementation, as shown in Figure 10, which can also include list creating module 53, number
Adding module 54, queue establish module 55 and queue mark module 56.The list creating module 53 is configured as according to multiple industry
The mark of business side and the priority level of multiple business sides, create queue lists, wherein the mark of multiple business sides in queue lists
It is according to priority level from high to low tactic.The number adding module 54 is configured as according to multiple in queue lists
The mark of business side puts in order, and addition indicates that multiple sequences of the priority level of multiple business sides are compiled in queue lists
Number.The queue establishes module 55 and is configured as establishing multiple tasks team corresponding with multiple priority levels in queue lists
Column.The queue mark module 56 is configured as marking each task queue according to the sequencing numbers of corresponding priority level
Note, so that label of the second server according to task queue, determines priority level corresponding to task queue.
In one possible implementation, as shown in Figure 10, which can also include request receiving module 57 and mark
Know adding module 58.The request receiving module 57 be configured as when the business side received task processing request when, according to appoint
Business processing requests to determine the priority level of business side.The mark adding module 58 is configured as preferential according to corresponding to business side
The mark of business side is added in queue lists by rank.
Task Processing Unit provided by the embodiment of the present disclosure, when receiving the task of business side's transmission, according to queue
List determines the first priority level of business side.Task is added to corresponding with the first priority level in multiple tasks queue
In one task queue, so that second server is according to the rank of the first priority level sequence execution task.It can make first service
Device is allocated according to task of the priority level to the transmission of business side, and makes second server according to the grade of the first priority level
Not Pai Xu execution task, can be realized task issued to business side dynamic expansion, configuration, meet what business side issued it
The execution demand of task.
Figure 11 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure.As shown in figure 11, the device application
Second server in server cluster, server cluster include first server and multiple second servers.The device can
To include second level determining module 61 and task execution module 62.The second level determining module 61 is configured as according to acquisition
The queue lists arrived determine multiple priority levels corresponding with the multiple tasks queue of first server.The task execution module
62 are configured as sorting according to the rank of priority level, execute the task in multiple tasks queue.Wherein, include in queue lists
Corresponding relationship between the mark and the priority level of multiple business sides of multiple business sides.
Figure 12 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure.In a kind of possible implementation
In, as shown in figure 12, second level determining module 61 may include that rank determines submodule 611.The rank determines submodule
611, according to the sequencing numbers for the priority level for indicating multiple business sides in queue lists, determining multiple with first server
Priority level corresponding to each task queue in business queue.Wherein, in queue lists further include indicate each business side excellent
The sequencing numbers of first rank, task queue are marked according to the sequencing numbers of corresponding priority level.
Task Processing Unit provided by the embodiment of the present disclosure, according to the queue lists got, determining and first service
The corresponding multiple priority levels of the multiple tasks queue of device.It sorts, is executed in multiple tasks queue according to the rank of priority level
Task.Dynamic expansion, the configuration that can be realized task issued to business side, so that second server can satisfy business side
The execution demand for the task that it is issued.
About the device in above-described embodiment, wherein modules execute the concrete mode of operation in related this method
Embodiment in be described in detail, no detailed explanation will be given here.
It should be noted that although using above-mentioned as above, the those skilled in the art that as example describes Task Processing Unit
Member it is understood that the disclosure answer it is without being limited thereto.In fact, user completely can be according to personal preference and/or practical application scene spirit
It is living to set each module, as long as meeting the technical solution of the disclosure.
Figure 13 shows the block diagram of the Task Processing Unit according to one embodiment of the disclosure.For example, device 1900 can be mentioned
For for a server.Referring to Fig.1 3, it further comprises one or more processors that device 1900, which includes processing component 1922,
And memory resource represented by a memory 1932, for store can by the instruction of the execution of processing component 1922, such as
Application program.The application program stored in memory 1932 may include it is one or more each correspond to one group refer to
The module of order.In addition, processing component 1922 is configured as executing instruction, to execute the above method.
Device 1900 can also include that a power supply module 1926 be configured as the power management of executive device 1900, and one
Wired or wireless network interface 1950 is configured as device 1900 being connected to network and input and output (I/O) interface
1958.Device 1900 can be operated based on the operating system for being stored in memory 1932, such as Windows ServerTM, Mac
OS XTM, UnixTM, LinuxTM, FreeBSDTM or similar.
In the exemplary embodiment, a kind of non-volatile computer readable storage medium storing program for executing is additionally provided, for example including calculating
The memory 1932 of machine program instruction, above-mentioned computer program instructions can be executed by the processing component 1922 of device 1900 to complete
The above method.
The disclosure can be system, method and/or computer program product.Computer program product may include computer
Readable storage medium storing program for executing, containing for making processor realize the computer-readable program instructions of various aspects of the disclosure.
Computer readable storage medium, which can be, can keep and store the tangible of the instruction used by instruction execution equipment
Equipment.Computer readable storage medium for example can be-- but it is not limited to-- storage device electric, magnetic storage apparatus, optical storage
Equipment, electric magnetic storage apparatus, semiconductor memory apparatus or above-mentioned any appropriate combination.Computer readable storage medium
More specific example (non exhaustive list) includes: portable computer diskette, hard disk, random access memory (RAM), read-only deposits
It is reservoir (ROM), erasable programmable read only memory (EPROM or flash memory), static random access memory (SRAM), portable
Compact disk read-only memory (CD-ROM), digital versatile disc (DVD), memory stick, floppy disk, mechanical coding equipment, for example thereon
It is stored with punch card or groove internal projection structure and the above-mentioned any appropriate combination of instruction.Calculating used herein above
Machine readable storage medium storing program for executing is not interpreted that instantaneous signal itself, the electromagnetic wave of such as radio wave or other Free propagations lead to
It crosses the electromagnetic wave (for example, the light pulse for passing through fiber optic cables) of waveguide or the propagation of other transmission mediums or is transmitted by electric wire
Electric signal.
Computer-readable program instructions as described herein can be downloaded to from computer readable storage medium it is each calculate/
Processing equipment, or outer computer or outer is downloaded to by network, such as internet, local area network, wide area network and/or wireless network
Portion stores equipment.Network may include copper transmission cable, optical fiber transmission, wireless transmission, router, firewall, interchanger, gateway
Computer and/or Edge Server.Adapter or network interface in each calculating/processing equipment are received from network to be counted
Calculation machine readable program instructions, and the computer-readable program instructions are forwarded, for the meter being stored in each calculating/processing equipment
In calculation machine readable storage medium storing program for executing.
Computer program instructions for executing disclosure operation can be assembly instruction, instruction set architecture (ISA) instructs,
Machine instruction, machine-dependent instructions, microcode, firmware instructions, condition setup data or with one or more programming languages
The source code or object code that any combination is write, the programming language include the programming language-of object-oriented such as
Smalltalk, C++ etc., and conventional procedural programming languages-such as " C " language or similar programming language.Computer
Readable program instructions can be executed fully on the user computer, partly execute on the user computer, be only as one
Vertical software package executes, part executes on the remote computer or completely in remote computer on the user computer for part
Or it is executed on server.In situations involving remote computers, remote computer can pass through network-packet of any kind
It includes local area network (LAN) or wide area network (WAN)-is connected to subscriber computer, or, it may be connected to outer computer (such as benefit
It is connected with ISP by internet).In some embodiments, by utilizing computer-readable program instructions
Status information carry out personalized customization electronic circuit, such as programmable logic circuit, field programmable gate array (FPGA) or can
Programmed logic array (PLA) (PLA), the electronic circuit can execute computer-readable program instructions, to realize each side of the disclosure
Face.
Referring herein to according to the flow chart of the method, apparatus (system) of the embodiment of the present disclosure and computer program product and/
Or block diagram describes various aspects of the disclosure.It should be appreciated that flowchart and or block diagram each box and flow chart and/
Or in block diagram each box combination, can be realized by computer-readable program instructions.
These computer-readable program instructions can be supplied to general purpose computer, special purpose computer or other programmable datas
The processor of processing unit, so that a kind of machine is produced, so that these instructions are passing through computer or other programmable datas
When the processor of processing unit executes, function specified in one or more boxes in implementation flow chart and/or block diagram is produced
The device of energy/movement.These computer-readable program instructions can also be stored in a computer-readable storage medium, these refer to
It enables so that computer, programmable data processing unit and/or other equipment work in a specific way, thus, it is stored with instruction
Computer-readable medium then includes a manufacture comprising in one or more boxes in implementation flow chart and/or block diagram
The instruction of the various aspects of defined function action.
Computer-readable program instructions can also be loaded into computer, other programmable data processing units or other
In equipment, so that series of operation steps are executed in computer, other programmable data processing units or other equipment, to produce
Raw computer implemented process, so that executed in computer, other programmable data processing units or other equipment
Instruct function action specified in one or more boxes in implementation flow chart and/or block diagram.
The flow chart and block diagram in the drawings show system, method and the computer journeys according to multiple embodiments of the disclosure
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
One module of table, program segment or a part of instruction, the module, program segment or a part of instruction include one or more use
The executable instruction of the logic function as defined in realizing.In some implementations as replacements, function marked in the box
It can occur in a different order than that indicated in the drawings.For example, two continuous boxes can actually be held substantially in parallel
Row, they can also be executed in the opposite order sometimes, and this depends on the function involved.It is also noted that block diagram and/or
The combination of each box in flow chart and the box in block diagram and or flow chart, can the function as defined in executing or dynamic
The dedicated hardware based system made is realized, or can be realized using a combination of dedicated hardware and computer instructions.
The presently disclosed embodiments is described above, above description is exemplary, and non-exclusive, and
It is not limited to disclosed each embodiment.Without departing from the scope and spirit of illustrated each embodiment, for this skill
Many modifications and changes are obvious for the those of ordinary skill in art field.The selection of term used herein, purport
In the principle, practical application or technological improvement to the technology in market for best explaining each embodiment, or lead this technology
Other those of ordinary skill in domain can understand each embodiment disclosed herein.
Claims (14)
1. a kind of task processing method, which is characterized in that applied to the first server in server cluster, the server set
Group includes first server and multiple second servers, which comprises
When receiving the task of business side's transmission, the first priority level of the business side is determined according to queue lists；
The task is added in multiple tasks queue in first task queue corresponding with first priority level, so that
Second server executes the task according to the sequence of the rank of first priority level,
Wherein, the mark pass corresponding between the priority level of multiple business sides in the queue lists including multiple business sides
System.
2. the method according to claim 1, wherein the method also includes:
According to the mark of multiple business sides and the priority level of the multiple business side, queue lists are created, wherein the queue
The mark of multiple business sides is according to priority level from high to low tactic in list；
According to putting in order for the mark of business sides multiple in the queue lists, addition is indicated multiple in the queue lists
Multiple sequencing numbers of the priority level of business side；
Establish multiple tasks queue corresponding with multiple priority levels in the queue lists；
Each task queue is marked according to the sequencing numbers of corresponding priority level so that the second server according to
The label of task queue determines priority level corresponding to task queue.
3. according to the method described in claim 2, it is characterized in that, the method also includes:
When the task of the business side received handles request, request is handled according to the task and determines the preferential of the business side
Rank；
According to priority level corresponding to the business side, the mark of the business side is added in the queue lists.
4. a kind of task processing method, which is characterized in that applied to the second server in server cluster, the server set
Group includes first server and multiple second servers, which comprises
According to the queue lists got, multiple priority corresponding with the multiple tasks queue of the first server are determined
Not；
It sorts according to the rank of priority level, executes the task in the multiple task queue,
Wherein, the mark pass corresponding between the priority level of multiple business sides in the queue lists including multiple business sides
System.
5. according to the method described in claim 4, it is characterized in that, being determined and described first according to the queue lists got
The corresponding multiple priority levels of the multiple tasks queue of server, comprising:
According to the sequencing numbers for the priority level for indicating multiple business sides in the queue lists, the determining and first server
Multiple tasks queue in priority level corresponding to each task queue,
It wherein, further include the sequencing numbers for indicating the priority level of each business side, the task queue in the queue lists
It is to be marked according to the sequencing numbers of corresponding priority level.
6. a kind of Task Processing Unit, which is characterized in that applied to the first server in server cluster, the server set
Group includes first server and multiple second servers, described device include:
First level determining module determines the business side according to queue lists when receiving the task of business side's transmission
First priority level；
The task is added in multiple tasks queue corresponding first with first priority level by task allocating module
It is engaged in queue, so that second server executes the task according to the sequence of the rank of first priority level,
Wherein, the mark pass corresponding between the priority level of multiple business sides in the queue lists including multiple business sides
System.
7. device according to claim 6, which is characterized in that described device further include:
List creating module creates queue lists according to the mark of multiple business sides and the priority level of the multiple business side,
Wherein, the mark of multiple business sides is according to priority level from high to low tactic in the queue lists；
Number adding module, according to putting in order for the mark of business sides multiple in the queue lists, in the queue lists
Middle addition indicates multiple sequencing numbers of the priority level of multiple business sides；
Module is established in queue, establishes multiple tasks queue corresponding with multiple priority levels in the queue lists；
Queue mark module is marked each task queue according to the sequencing numbers of corresponding priority level, so that described
Second server determines priority level corresponding to task queue according to the label of task queue.
8. device according to claim 7, which is characterized in that described device further include:
Request receiving module handles according to the task when the task of the business side received handles request and requests to determine institute
State the priority level of business side；
Adding module is identified, according to priority level corresponding to the business side, the mark of the business side is added to described
In queue lists.
9. a kind of Task Processing Unit, which is characterized in that applied to the second server in server cluster, the server set
Group includes first server and multiple second servers, described device include:
Second level determining module, according to the queue lists got, the determining multiple tasks queue with the first server
Corresponding multiple priority levels；
Task execution module sorts according to the rank of priority level, executes the task in the multiple task queue,
Wherein, the mark pass corresponding between the priority level of multiple business sides in the queue lists including multiple business sides
System.
10. device according to claim 9, which is characterized in that the second level determining module, comprising:
Rank determines submodule, according to the sequencing numbers for the priority level for indicating multiple business sides in the queue lists, determines
With priority level corresponding to each task queue in the multiple tasks queue of the first server,
It wherein, further include the sequencing numbers for indicating the priority level of each business side, the task queue in the queue lists
It is to be marked according to the sequencing numbers of corresponding priority level.
11. a kind of Task Processing Unit characterized by comprising
Processor；
Memory for storage processor executable instruction；
Wherein, the processor is configured to method described in any one of perform claim requirement 1 to 3.
12. a kind of non-volatile computer readable storage medium storing program for executing, is stored thereon with computer program instructions, which is characterized in that institute
It states and realizes method described in any one of claims 1 to 3 when computer program instructions are executed by processor.
13. a kind of Task Processing Unit characterized by comprising
Processor；
Memory for storage processor executable instruction；
Wherein, the processor is configured to method described in perform claim requirement 4 or 5.
14. a kind of non-volatile computer readable storage medium storing program for executing, is stored thereon with computer program instructions, which is characterized in that institute
It states and realizes method described in claim 4 or 5 when computer program instructions are executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810272621.3A CN110321202A (en) | 2018-03-29 | 2018-03-29 | Task processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810272621.3A CN110321202A (en) | 2018-03-29 | 2018-03-29 | Task processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110321202A true CN110321202A (en) | 2019-10-11 |
Family
ID=68110968
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810272621.3A Pending CN110321202A (en) | 2018-03-29 | 2018-03-29 | Task processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110321202A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110728455A (en) * | 2019-10-17 | 2020-01-24 | 京东数字科技控股有限公司 | Service processing method, service processing device, storage medium and electronic equipment |
| CN111198546A (en) * | 2020-01-02 | 2020-05-26 | 北京众信易保科技有限公司 | Data acquisition control method and system |
| CN111209112A (en) * | 2019-12-31 | 2020-05-29 | 杭州迪普科技股份有限公司 | Exception handling method and device |
| CN111400005A (en) * | 2020-03-13 | 2020-07-10 | 北京搜狐新媒体信息技术有限公司 | Data processing method and device and electronic equipment |
| CN112395107A (en) * | 2020-11-17 | 2021-02-23 | 航天信息股份有限公司 | Tax control equipment control method and device, storage medium and electronic equipment |
| CN112468551A (en) * | 2020-11-16 | 2021-03-09 | 浪潮云信息技术股份公司 | Intelligent scheduling working method based on service priority |
| CN112817808A (en) * | 2019-11-18 | 2021-05-18 | 赵伟 | Computer cluster maintenance task management method and system |
| CN113344375A (en) * | 2021-06-01 | 2021-09-03 | 北京十一贝科技有限公司 | Task management method, device, electronic equipment and medium in insurance service process |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1627778A (en) * | 2003-12-11 | 2005-06-15 | 华为技术有限公司 | Method for realizing precedence service of data packets |
| US20150324226A1 (en) * | 2008-06-19 | 2015-11-12 | Commvault Systems, Inc. | Data storage resource allocation using logical holding areas to reserve resources for higher priority storage operation requests |
| CN106101074A (en) * | 2016-05-31 | 2016-11-09 | 北京大学 | A kind of sacurity dispatching method based on user's classification towards big data platform |
| CN106326339A (en) * | 2016-08-03 | 2017-01-11 | 上海蔓盈信息科技有限公司 | Task allocating method and device |
| CN106802826A (en) * | 2016-12-23 | 2017-06-06 | ***股份有限公司 | A kind of method for processing business and device based on thread pool |
| CN107239342A (en) * | 2017-05-31 | 2017-10-10 | 郑州云海信息技术有限公司 | A kind of storage cluster task management method and device |
| CN107391268A (en) * | 2016-05-17 | 2017-11-24 | 阿里巴巴集团控股有限公司 | service request processing method and device |
-
2018
- 2018-03-29 CN CN201810272621.3A patent/CN110321202A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1627778A (en) * | 2003-12-11 | 2005-06-15 | 华为技术有限公司 | Method for realizing precedence service of data packets |
| US20150324226A1 (en) * | 2008-06-19 | 2015-11-12 | Commvault Systems, Inc. | Data storage resource allocation using logical holding areas to reserve resources for higher priority storage operation requests |
| CN107391268A (en) * | 2016-05-17 | 2017-11-24 | 阿里巴巴集团控股有限公司 | service request processing method and device |
| CN106101074A (en) * | 2016-05-31 | 2016-11-09 | 北京大学 | A kind of sacurity dispatching method based on user's classification towards big data platform |
| CN106326339A (en) * | 2016-08-03 | 2017-01-11 | 上海蔓盈信息科技有限公司 | Task allocating method and device |
| CN106802826A (en) * | 2016-12-23 | 2017-06-06 | ***股份有限公司 | A kind of method for processing business and device based on thread pool |
| CN107239342A (en) * | 2017-05-31 | 2017-10-10 | 郑州云海信息技术有限公司 | A kind of storage cluster task management method and device |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110728455A (en) * | 2019-10-17 | 2020-01-24 | 京东数字科技控股有限公司 | Service processing method, service processing device, storage medium and electronic equipment |
| CN112817808A (en) * | 2019-11-18 | 2021-05-18 | 赵伟 | Computer cluster maintenance task management method and system |
| CN112817808B (en) * | 2019-11-18 | 2024-04-19 | 赵伟 | Computer cluster maintenance task management method and system |
| CN111209112A (en) * | 2019-12-31 | 2020-05-29 | 杭州迪普科技股份有限公司 | Exception handling method and device |
| CN111198546A (en) * | 2020-01-02 | 2020-05-26 | 北京众信易保科技有限公司 | Data acquisition control method and system |
| CN111198546B (en) * | 2020-01-02 | 2021-04-06 | 北京众信易保科技有限公司 | Data acquisition control method and system |
| CN111400005A (en) * | 2020-03-13 | 2020-07-10 | 北京搜狐新媒体信息技术有限公司 | Data processing method and device and electronic equipment |
| CN112468551A (en) * | 2020-11-16 | 2021-03-09 | 浪潮云信息技术股份公司 | Intelligent scheduling working method based on service priority |
| CN112395107A (en) * | 2020-11-17 | 2021-02-23 | 航天信息股份有限公司 | Tax control equipment control method and device, storage medium and electronic equipment |
| CN113344375A (en) * | 2021-06-01 | 2021-09-03 | 北京十一贝科技有限公司 | Task management method, device, electronic equipment and medium in insurance service process |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110321202A (en) | Task processing method and device | |
| US10983902B2 (en) | Collaborative computer aided test plan generation | |
| CN106371918B (en) | Task cluster schedule management method and device | |
| US20140278652A1 (en) | Hybrid system and method for selecting and deploying field technicians in a facilities management hybrid workforce | |
| CN108182111A (en) | Task scheduling system, method and apparatus | |
| US10896407B2 (en) | Cognitive adaptation to user behavior for personalized automatic processing of events | |
| CN109992407A (en) | A kind of YARN cluster GPU resource dispatching method, device and medium | |
| Shahrbanoo et al. | An Approach for agile SOA development using agile principals | |
| CN109697121A (en) | For method, equipment and the computer program product to application allocation processing resource | |
| CN109242288A (en) | Performance data matching process and system | |
| US10289979B2 (en) | Greeting agent for meeting introductions | |
| US11687370B2 (en) | Activity assignment based on resource and service availability | |
| CN109858975A (en) | More conversation type smart allocation methods, system, equipment and storage medium | |
| US20170132549A1 (en) | Automated information technology resource system | |
| Wielki et al. | The analysis of opportunities to use the lean it concept in modern enterprise | |
| JP2017138788A (en) | Arrangement determination system, arrangement determination method and program | |
| US20160350686A1 (en) | Implementing workflow based on social network nodes | |
| US10824974B2 (en) | Automatic subject matter expert profile generator and scorer | |
| CN110308976A (en) | Task processing method and device | |
| US20220222606A1 (en) | Collaborative working space in an xr environment | |
| US11178038B1 (en) | Internet of things device orchestration | |
| Albalghouni et al. | Challenges of implementing ISO 55000: a case study from an educational institute | |
| US10554811B2 (en) | Predicting ‘usefullness’ of a call by analysing digital footprint of a person | |
| CN112749822B (en) | Method and device for generating route | |
| US20230306327A1 (en) | Techniques for discovering and sharing digital workflow task assignments |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200520 Address after: 310052 room 508, floor 5, building 4, No. 699, Wangshang Road, Changhe street, Binjiang District, Hangzhou City, Zhejiang Province Applicant after: Alibaba (China) Co.,Ltd. Address before: 100080 Beijing Haidian District city Haidian street A Sinosteel International Plaza No. 8 block 5 layer A, C Applicant before: Youku network technology (Beijing) Co.,Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191011 |