CN106790649A - Server task distribution method - Google Patents
Server task distribution method Download PDFInfo
- Publication number
- CN106790649A CN106790649A CN201710027921.0A CN201710027921A CN106790649A CN 106790649 A CN106790649 A CN 106790649A CN 201710027921 A CN201710027921 A CN 201710027921A CN 106790649 A CN106790649 A CN 106790649A
- Authority
- CN
- China
- Prior art keywords
- server
- task
- service
- job order
- distributor
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1012—Server selection for load balancing based on compliance of requirements or conditions with available server resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1029—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers using data related to the state of servers by a load balancer
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Multi Processors (AREA)
Abstract
The invention discloses a kind of server task distribution method, it is characterised in that at least comprise the following steps：Step one：Distributor is connected respectively to multiple servers, distributor is used to receive job order from network, and job order is distributed to server, server distributor is used to complete job order treatment；Step 2：Distributor judges whether job order meets specified services requirement when job order is received, if met, job order is submitted to the server process for meeting specified services requirement, if do not met, performs step 3；Step 3：Distributor checks whether job order meets the past service request, if met, job order is submitted to the server process for meeting the past service request, if do not met, performs step 4；Step 4：Job order is distributed to the maximum server process of ability value by distributor.The present invention can realize distributor by the job order smart allocation of different characteristic to corresponding server, with good application prospect.
Description
Technical field
The present invention relates to a kind of server task distribution method, and in particular to one kind can automatically divide according to job order property
Server task distribution method with job order, the invention belongs to distribution method design field.
Background technology
If existing server receives being sended over from network for task, task can be processed.If from
Being sended in network for task is a lot, and that is accomplished by multiple servers and a distribution for distributing these job orders
Device.This distributor can distribute its job order for receiving to each server.But existing distributor distribution procedure mistake
In simple, method there is no to carry out intelligent automatic distributing to the various job orders for having specific characteristic.
The content of the invention
To solve the deficiencies in the prior art, it is an object of the invention to provide a kind of server task distribution method, to solve
Certainly existing distributor is difficult to the technical problem being distributed to the job order of different characteristic.
In order to realize above-mentioned target, the present invention is adopted the following technical scheme that：
Server task distribution method, it is characterised in that at least comprise the following steps：
Step one：Distributor is connected respectively to multiple servers, distributor is used to receive job order from network, and
Job order is distributed to server, server distributor is used to complete job order treatment；
Step 2：Distributor judges whether job order meets specified services requirement when job order is received, if met,
Job order is submitted to the server process for meeting specified services requirement, if do not met, step 3 is performed；
Step 3：Distributor checks whether job order meets the past service request, if met, job order is submitted into symbol
The server process of the past service request is closed, if do not met, step 4 is performed；
Step 4：Job order is distributed to the maximum server process of ability value by distributor.
Foregoing server task distribution method, it is characterised in that the step one is included according to the service of each server
Unit number calculates the service ability of each server, configuration server ability value table, specified services table, the past agent list.
Foregoing server task distribution method, it is characterised in that according to following configuration specified services table：
Configuration specified services table：If server is S, server-capabilities are r, task single eigenvalue is W, number of servers is
N, then Si represent that i-th server, ri represent that i-th disposal ability of server, Wj represent j-th characteristic value of task, refer to
Determine characteristic value of the agent list including appointed task, PW is used to represent the characteristic value of appointed task.
Foregoing server task distribution method, it is characterised in that according to following configuration server ability value table：Server
Ability value table includes each disposal ability ri of server, the server-capabilities value
Foregoing server task distribution method, it is characterised in that the past agent list includes appointing for each server
Business single eigenvalue, the last service time and service frequency.
Foregoing server task distribution method, it is characterised in that task single eigenvalue includes following one or more：
Business Name, time and sequence number contained by task odd numbers, full name of applicant, applicant's identification card number, the unit that task is submitted to
Code.
Foregoing server task distribution method, it is characterised in that the step 2 includes：Distribute when job order is reached
Device, distributor is met the specified services feature of certain server by its characteristic value by the order arranged in specified services table, inspection
Value, meets, and the job order submitted into satisfactory server process, and changes the service ability value of the server, i.e. its clothes
Business ability value subtracts 1；Afterwards, task single eigenvalue is extracted, is stored in the corresponding task single eigenvalue queue of the server, after being
Previously service used.
Foregoing server task distribution method, it is characterised in that the step 3 includes：When job order do not meet it is specified
After service request, distributor checks the meeting certain server by its characteristic value of the task by the order of assortment in the past agent list
Single eigenvalue, meets, and the job order submitted into satisfactory server process, and changes the service ability value of the server,
I.e. its service ability value subtracts 1.
Foregoing server task distribution method, it is characterised in that the step 4 includes：When job order had not both met finger
Determine service request, also do not meet the past service request, then distribute to ability value it is maximum and come most preceding server process, and
The service ability value of the server is changed, i.e., its service ability value subtracts 1.Afterwards, task single eigenvalue is extracted, the server is stored in
Previously service used in corresponding task single eigenvalue queue, after being.
Foregoing server task distribution method, it is characterised in that server-capabilities value is the service that the server has
The quantitative value of unit.
The present invention is advantageous in that：Server task distribution method of the invention can realize distributor by different spies
The job order smart allocation levied to corresponding server, with good application prospect.
Brief description of the drawings
Fig. 1 is the one of the invention flow implementation schematic diagram being preferable to carry out；
Fig. 2 is the hardware connection structure schematic diagram of task dissemination system of the present invention；
Specific embodiment
Make specific introduction to the present invention below in conjunction with the drawings and specific embodiments.
Shown in reference picture 2, task dissemination system of the invention includes the server of a distributor and some process tasks.
Distributor and server are in a basic network environment.The work of distributor (can also be called distributor) is, will be from net
Task is received in network, according to the server that be distributed to for current task automatically by task allocation algorithms, server is completed at task
Reason.
Such as Fig. 1, server task distribution method of the invention at least comprises the following steps：
Step one：Distributor is connected respectively to multiple servers, distributor is used to receive job order from network, and
Job order is distributed to server, server distributor is used to complete job order treatment；
Step 2：Distributor judges whether job order meets specified services requirement when job order is received, if met,
Job order is submitted to the server process for meeting specified services requirement, if do not met, step 3 is performed；
Step 3：Distributor checks whether job order meets the past service request, if met, job order is submitted into symbol
The server process of the past service request is closed, if do not met, step 4 is performed；
Step 4：Job order is distributed to the maximum server process of ability value by distributor.
One embodiment 1 is given below to illustrate concrete application mode of the invention.But those skilled in the art it should be clear that
The invention is not restricted to field where following embodiments.In embodiment 1, task dissemination system of the invention is intellectual property task
Single dissemination system.Job order can be the intellectual property application tasks such as the trademark application by client's submission.
In the present embodiment, the service ability of server is described as follows：Each server is likely to the treatment with varying number
Unit, if the ability of each processing unit is identical, then the disposal ability of server is often different, i.e., assuming that each task (list) institute
It is different in the quantity of unit interval server process task under the premise of the computing capability and storage resource identical that need to process.
Service is assigned three kinds of following forms in the present embodiment：
Form one：Specified services are distributed
Specified services are distributed for the treatment of job order given server.The service needs in advance to receive the configuration of certain server
Process task list feature, after the job order with this feature reaches distributor, the task is directly distributed the clothes by distributor
Business device.
Form two：Previously service distribution
Previously service distribution is used for the job order of same feature by same server process.Distributor presses certain limit
(such as continuous 10,000 job orders) records the characteristic value of distributed job order and the server for the treatment of service is carried out to the task
Number, afterwards, then after the job order for having same characteristic features value is arrived, it is not allocated by ability value, it is directly distributed to the clothes for recording before
Business device.
Form three：Distributed by ability value service
Job order distribution is carried out according to the ability value size of current each server by ability value service distribution, ability value is maximum
Server priority distribution job order, the server-capabilities value for receiving an assignment single accordingly reduce a value.
In this embodiment, for any one task (list), distributor first checks whether to meet assignment of allocation condition, such as
Meet, distribution terminates and task is given the server specified processed；Next checks whether previously service distributive condition,
As met, distribution terminates and is processed the server that task gives previously service；Finally, distributed by ability value service.
For identical specified services that may be present configuration, the past Service Matching and ability value between server, according to
The precedence of the access of storage is carried out.Match somebody with somebody as server of the job order feature with 2 or more than 2 specify
Put, then the job order preferentially distributes each arrangement first server process according to order.Similarly, as a job order feature meets
Server the past condition of 2 or more than 2, then the job order preferentially distributed according to order at the first server of each arrangement
Reason.The specific composition of this task dissemination system is described below.
Distributor is constituted
Dispensing device is mainly made up of calculator and memory.Task distribution method of the invention is in practice with algorithm side
Formula is realized.
1. calculator
Calculated for completing algorithm.
2. memory
If：Server is S, server-capabilities are r, task single eigenvalue is W, then SiRepresent the i-th (1, n) individual server, ri
N () represents the i-th (1, n) disposal ability (number of server processing unit), the W of individual serverjJ-th characteristic value of task.
PW represents the characteristic value of appointed task.
Table 1 below, table 2 and table 3 are set up respectively.
(1) server-capabilities storage
Table 1 presents the ability value of each server.
Table 1：Server-capabilities value table
| Server sequence number | Server name | Server-capabilities value |
| 1 | S1 | r1 |
| 2 | S2 | r2 |
| …… | Si | ri |
| n-1 | Sn-1 | rn-1 |
| n | Sn | rn |
Service provider's total capacity
(2) specified services storage
Table 2 presents 3 specified services characteristic values of each server.The specified services of actual each server as needed
Characteristic value may be not necessarily limited to the number of quantity.
Table 2：Specified services table
| Server sequence number | Server name | Specified services characteristic value 1 | Specified services feature 2 | Specified services feature 3 |
| 1 | S1 | PW1,1 | PW1,2 | PW1,3 |
| 2 | S2 | PW2,1 | PW2,2 | PW2,3 |
| …… | Si | PWi,1 | PWi,2 | PWi,3 |
| n-1 | Sn-1 | PW(n-1), 1 | PW(n-1), 2 | PW(n-1), 3 |
| n | Sn | PWn,1 | PWn,2 | PWn,3 |
(3) the past service memory
With the development of service, each server service processing multiple tasks lists, so each server can have
One queue of the past service features (or previously servicing single).New list can service single (feature) by the past to server,
Compare, determine whether the job order meets the regular of previously service and carry out service processing by the server, table 3 is illustrated both
Toward the record case of service.According to nearest service time and queue of the frequency to service features (or previously servicing single) can be serviced
Processed, the validity of the past service queue is reduced to improve, improved the efficiency of algorithm.
Table 3：The past agent list (job order client characteristics)
The gain of parameter mode such as ability value is described below.
1. ability value is obtained
If a job order of total r (being the service unit sum of each server) is distributed for distributor, can be by certain rule
(algorithm) r service unit of sequence arrangement from each server matches this r job order, and each service unit distribution one is single.Often
Carry out a list in addition to giving given server or the past server, always give the service unit number of wait most servers.
After one group of r job order distributes to r service unit, then rearrange r job order distribution r service unit, so circulation.This
The ability value of sample server translates into the quantitative value of the service unit that the server has.
2. task single eigenvalue
Task single eigenvalue is primarily referred to as Business Name contained by task odd numbers, time and sequence number, or applicant
Name, identification card number, or the code of unit etc. that task is submitted to.Due to specifically to determine which server job order returns at
Reason, in fact, often submitting the code of unit to as task single eigenvalue from applicant's identification card number or task.
3. specified services characteristic value
As the implication of task single eigenvalue, simply in actual applications, its effect is pin to specified services characteristic value
It is not in face of universal job order to individual tasks list.So, specified services feature services are in the absence of task characteristic value team
Row.
Operation flow is described below.
Configuration parameter
Service unit number according to each server calculates the service ability r of each serveri, configure PWi,j, i=1 ..., n, j
=1,2,3.Agent list and the past agent list are formulated in configuration.
After job order reaches distributor, distributed according to following flow：
1. whether specified services requirement is met.When job order reaches distributor, distributor is by arrangement in specified services table
Sequentially, the specified services characteristic value for meeting certain server by its characteristic value is checked, is met, the job order submitted and is conformed to
The server process asked, and change the service ability value of the server, i.e., its service ability value subtracts 1.Afterwards, job order is extracted special
Value indicative, is stored in the corresponding task single eigenvalue queue of the server, previously services used after being.
2. whether the past service request is met.After job order does not meet specified services requirement, distributor is by previously service
The order of assortment in table, inspection is met the task single eigenvalue of certain server by its characteristic value, is met, and the job order is passed
Hand over satisfactory server process, and change the service ability value of the server, be i.e. its service ability value subtracts 1.
3. distributed by ability value.When job order had not both met specified services requirement, the past service request is not met yet, then divided
Dispensing ability value it is maximum and come most preceding server process, and change the service ability value of the server, i.e. its service energy
Force value subtracts 1.Afterwards, task single eigenvalue is extracted, is stored in the corresponding task single eigenvalue queue of the server, after being previously
Service is used.
Server service list allocation algorithm is given below.
Agent list, the past agent list, configuration server ability value table are formulated in configuration, perform following algorithm, complete job order
Distribution.
If job order is T；There is n server, each server has r respectively1、r2、…、rnIndividual processing unit, and ability value pair
Should be c1、c2、…、cn, total processing unit r=r1+r2+…+rn, then when starting, i-th service ability of server is ri。
Program is as follows：
Notice that ci, cj are likely to occur negative value, but do not influence max (c1, c2 ..., cn) comparing.
The core concept of algorithm is to be provided with one group of n processing unit correspondence job order, each processing unit distribution one above
Job order.Often carry out a list in addition to giving given server or the past server, always give the clothes of most wait tasks treatment
Business device.After one group of n processing unit distributes n job orders, then recalculate one group.The service ability of server, is converted into clothes
The quantity of business unit.When Servers-all is all connected to the job order no less than setting odd number, start next group task.Thus may be used
See, server task distribution method of the present invention can realize distributor by the job order smart allocation of different characteristic to corresponding clothes
Business device, distribution method is not related to probability, and is allocated just for job order and reduces the complexity of algorithm.And the clothes of server
Business ability, correspondence is converted into the quantity of service unit, realizes making clear for service ability.
Additionally, the present invention is compared using ability value, and simple addition and subtraction modification ability value, instead of the probability of other algorithms
Differentiate and probability amending method, clear thinking, calculate simple.
The basic principles, principal features and advantages of the present invention have been shown and described above.The technical staff of the industry should
Understand, the invention is not limited in any way for above-described embodiment, it is all to be obtained by the way of equivalent or equivalent transformation
Technical scheme, all falls within protection scope of the present invention.
Claims (10)
1. server task distribution method, it is characterised in that at least comprise the following steps：
Step one：Distributor is connected respectively to multiple servers, distributor is used to receive job order from network, and will appoint
Business is singly distributed to server, and server distributor is used to complete job order treatment；
Step 2：Distributor judges whether job order meets specified services requirement when job order is received, if met, will appoint
Business is singly submitted to the server process for meeting specified services requirement, if do not met, performs step 3；
Step 3：Distributor checks whether job order meets the past service request, if met, job order is submitted to and meets this
The server process of the past service request, if do not met, performs step 4；
Step 4：Job order is distributed to the maximum server process of ability value by distributor.
2. server task distribution method according to claim 1, it is characterised in that the step one is included according to each clothes
The service unit number of business device calculates the service ability of each server, configuration server ability value table, previously specified services table, service
Table.
3. server task distribution method according to claim 2, it is characterised in that according to following configuration specified services
Table：Configuration specified services table：If server is S, server-capabilities are r, task single eigenvalue is W, number of servers is n, then
Si represents that i-th server, ri represent that i-th disposal ability of server, Wj represent j-th characteristic value of task, specifies clothes
Business table includes the characteristic value of appointed task, and PW is used to represent the characteristic value of appointed task.
4. server task distribution method according to claim 2, it is characterised in that according to following configuration server ability
Value table：Server-capabilities value table includes each disposal ability ri of server, the server-capabilities value
5. server task distribution method according to claim 2, it is characterised in that the past agent list includes each
The task single eigenvalue of server, the last service time and service frequency.
6. server task distribution method according to claim 5, it is characterised in that task single eigenvalue includes following
One or more：Business Name, time and sequence number contained by task odd numbers, full name of applicant, applicant's identification card number, task
The code of the unit of submission.
7. server task distribution method according to claim 1, it is characterised in that the step 2 includes：Work as task
Single to reach distributor, distributor is met the finger of certain server by its characteristic value by the order arranged in specified services table, inspection
Determine service characteristic value, meet, the job order is submitted into satisfactory server process, and change the service energy of the server
Force value, i.e. its service ability value subtract 1；Afterwards, task single eigenvalue is extracted, the corresponding task single eigenvalue team of the server is stored in
Previously service used in row, after being.
8. server task distribution method according to claim 1, it is characterised in that the step 3 includes：Work as task
After not meeting specified services requirement singly, distributor is checked and is met certain by its characteristic value by the order of assortment in the past agent list
The task single eigenvalue of server, meets, and the job order is submitted into satisfactory server process, and change the server
Service ability value, i.e. its service ability value subtracts 1.
9. server task distribution method according to claim 1, it is characterised in that the step 4 includes：Work as task
It is single both not met specified services requirement, do not meet the past service request yet, then distribute to ability value it is maximum and come most preceding
Server process, and change the service ability value of the server, i.e., its service ability value subtracts 1.Afterwards, job order feature is extracted
Value, is stored in the corresponding task single eigenvalue queue of the server, previously services used after being.
10. server task distribution method according to claim 4, it is characterised in that server-capabilities value is the service
The quantitative value of the service unit that utensil has.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2016106857281 | 2016-08-16 | ||
| CN201610685728 | 2016-08-16 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106790649A true CN106790649A (en) | 2017-05-31 |
Family
ID=58946854
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710027921.0A Pending CN106790649A (en) | 2016-08-16 | 2017-01-16 | Server task distribution method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106790649A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102857505A (en) * | 2012-09-06 | 2013-01-02 | 上海计算机软件技术开发中心 | Data bus middleware of Internet of things |
| CN103347062A (en) * | 2013-06-24 | 2013-10-09 | 北京汉柏科技有限公司 | Virtual computing resource distribution method |
| CN103401947A (en) * | 2013-08-20 | 2013-11-20 | 曙光信息产业(北京)有限公司 | Method and device for allocating tasks to multiple servers |
| CN103763206A (en) * | 2014-01-21 | 2014-04-30 | 能力天空科技（北京）有限公司 | Network scheduling method and gateway |
| CN104680406A (en) * | 2013-11-27 | 2015-06-03 | 英业达科技有限公司 | Rental system and rental method for service side |
| CN105007337A (en) * | 2015-08-20 | 2015-10-28 | 浪潮(北京)电子信息产业有限公司 | Cluster system load balancing method and system thereof |
-
2017
- 2017-01-16 CN CN201710027921.0A patent/CN106790649A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102857505A (en) * | 2012-09-06 | 2013-01-02 | 上海计算机软件技术开发中心 | Data bus middleware of Internet of things |
| CN103347062A (en) * | 2013-06-24 | 2013-10-09 | 北京汉柏科技有限公司 | Virtual computing resource distribution method |
| CN103401947A (en) * | 2013-08-20 | 2013-11-20 | 曙光信息产业(北京)有限公司 | Method and device for allocating tasks to multiple servers |
| CN104680406A (en) * | 2013-11-27 | 2015-06-03 | 英业达科技有限公司 | Rental system and rental method for service side |
| CN103763206A (en) * | 2014-01-21 | 2014-04-30 | 能力天空科技（北京）有限公司 | Network scheduling method and gateway |
| CN105007337A (en) * | 2015-08-20 | 2015-10-28 | 浪潮(北京)电子信息产业有限公司 | Cluster system load balancing method and system thereof |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103699446B (en) | Quantum-behaved particle swarm optimization (QPSO) algorithm based multi-objective dynamic workflow scheduling method | |
| CN107590002A (en) | Method for allocating tasks, device, storage medium, equipment and distributed task scheduling system | |
| CN110163474A (en) | A kind of method and apparatus of task distribution | |
| CN103761146B (en) | A kind of method that MapReduce dynamically sets slots quantity | |
| CN107832901A (en) | Method for allocating tasks, device, terminal device and storage medium | |
| CN106453146B (en) | Method, system, device and readable storage medium for allocating private cloud computing resources | |
| CN104901989B (en) | A kind of Site Service offer system and method | |
| CN110400140A (en) | Layering fragment exchange information processing method and application based on Fabric | |
| CN108241539B (en) | Interactive big data query method and device based on distributed system, storage medium and terminal equipment | |
| CN105094970B (en) | The method of more times scheduling models of task can be divided under a kind of solution distributed system | |
| CN106528683A (en) | Index segmenting equalization based big data cloud search platform and method thereof | |
| CN107888660B (en) | Cloud service resource allocation method, medium, device and computing equipment | |
| CN110058940A (en) | Data processing method and device under a kind of multi-thread environment | |
| WO2023087658A1 (en) | Task scheduling method, apparatus and device, and readable storage medium | |
| WO2022142666A1 (en) | Data processing method and apparatus, and terminal device and storage medium | |
| CN108270581A (en) | Shared resource charge processing method and device | |
| CN110119310A (en) | Method for distributing system resource, device, computer readable storage medium and server | |
| CN107248034A (en) | Business clues distribution method, device, computing device and storage medium | |
| WO2021036319A1 (en) | Data cleaning method and system | |
| CN110163455A (en) | A kind of direct broadcasting room integrated evaluating method, storage medium, equipment and system | |
| CN104156505B (en) | A kind of Hadoop cluster job scheduling method and devices based on user behavior analysis | |
| CN107067187A (en) | Telephony task management method, storage device, storage medium and device | |
| CN110097268A (en) | Task allocation method and device, electronic equipment and storage medium | |
| CN112306642B (en) | Workflow scheduling method based on stable matching game theory | |
| CN106790649A (en) | Server task distribution method |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: Room 1202, floor 12, building 6, Chuangzhi Green Valley Development Center, 788 HONGPU Road, Jianggan District, Hangzhou City, Zhejiang Province Applicant after: Hangzhou: Intellectual Property Services Limited Address before: 310000, room 4, building 303, No. nine, ring 9, Hangzhou, Zhejiang, Jianggan District, China Applicant before: Hangzhou: Intellectual Property Services Limited |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170531 |