CN106161643A - Task distribution formula processing method, device and Cloud Server - Google Patents
Task distribution formula processing method, device and Cloud Server Download PDFInfo
- Publication number
- CN106161643A CN106161643A CN201610596889.3A CN201610596889A CN106161643A CN 106161643 A CN106161643 A CN 106161643A CN 201610596889 A CN201610596889 A CN 201610596889A CN 106161643 A CN106161643 A CN 106161643A
- Authority
- CN
- China
- Prior art keywords
- task
- node
- application
- service request
- idle condition
- 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.)
- Granted
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
-
- 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/104—Peer-to-peer [P2P] networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
- Information Transfer Between Computers (AREA)
Abstract
A kind of task distribution formula processing method, device and Cloud Server, described task distribution formula processing method includes: the service receiving the application node in peer-to-peer network is asked；It is assigned to the task that described service request is pointed in described peer-to-peer network at least one to be at other application nodes of idle condition and process；After at least one other application node being in idle condition described complete task process, receive the task result fed back from least one other application node being in idle condition described；Described task result is fed back to propose the application node of described service request.The present invention program can realize a kind of low in hardware cost and have the Cloud Server of security, confidentiality and high efficiency concurrently.
Description
Technical field
The present invention relates to Internet communication technology, particularly to a kind of task distribution formula processing method, device and cloud service
Device.
Background technology
With the development of Internet communication technology, the effect of Cloud Server starts to be approved more and more, and user is permissible
Implement various service and application by Cloud Server.Meanwhile, with peer-to-peer network (Peer to Peer
Networking, P2P) development of technology, also obtain in a network while resource is provided based on the peer-to-peer network of P2P framework
Resource.
Can provide cloud service at present is the powerful operator of solid financial strength, hardware foundation mostly, for user
For, the cost on the one hand rented is higher, and for another aspect, the specification rented also has a lot of restriction.Additionally, for cloud clothes
For the operand of business own and data volume are not very big application, the Cloud Server that renting operator provides not is very suitable.
If resource coordination idle on network can be got up, and being allocated on network as a kind of resource, will produce very
Significant value.
Therefore, the use of prior art Cloud Server price for a user is costly, and it cannot be guaranteed that server money
Source is used effectively.
Content of the invention
Present invention solves the technical problem that it is how to realize the cloud service skill that a kind of with low cost and resource is used effectively
Art.
For solving above-mentioned technical problem, the embodiment of the present invention provides a kind of task distribution formula processing method, comprising: it is right to receive
Service request Deng the application node in network；The task that described service request is pointed to is assigned in described peer-to-peer network at least
Process at one other application node being in idle condition；Described at least one be in idle condition other application
After node completes task process, receive at the task that at least one other application node being in idle condition described feeds back
Reason result；Described task result is fed back to propose the application node of described service request.
Alternatively, in the described task by described service request sensing is assigned to described peer-to-peer network, at least one is in
After processing at other application nodes of idle condition, and receive from described at least one be in its of idle condition
Before the task result of his application node feedback, also include: whether inquiry is assigned to each application node of described task
Exit from idle status；If so, will move out the task distribution that the application node of idle condition undertakes to being in other of idle condition
Application node.
Alternatively, in the described task by described service request sensing is assigned to described peer-to-peer network, at least one is in sky
Carry out process at other application nodes of not busy state to include: the task that described service request is pointed to is split, will split
To subtask be assigned in described peer-to-peer network at least one and be at other application nodes of idle condition and process.
Alternatively, each application node in described peer-to-peer network has node address, the clothes of described reception application node
Business request includes: record proposes the node address of the application node of described service request；
The described application node that described task result feeds back to described proposition service request includes: according to proposition institute
State the node address of the application node of service request, described task result is fed back to propose the application of described service request
Node；
Described by described service request point to task be assigned to described peer-to-peer network at least one is in idle condition
Other application nodes at carry out process and include: according to the node address of other application nodes being in idle condition to described
Business is allocated.
Alternatively, described task distribution formula processing method also includes: receive at the application node proposing described service request
After described task result, receive the feedback of the task completion status of the application node transmission proposing described service request.
For solving above-mentioned technical problem, the embodiment of the present invention also provides a kind of task distribution formula processing means, comprising: request
Receiving unit, is suitable to receive the service request of the application node in peer-to-peer network；Task allocation unit, being suitable to please by described service
The task of asking sensing is assigned in described peer-to-peer network at least one and is in and processes at other application nodes of idle condition；
Result receiving unit, is suitable to after at least one other application node being in idle condition described complete task process,
Receive the task result fed back from least one other application node being in idle condition described；Result is fed back
Unit, is suitable to feed back to propose by described task result the application node of described service request.
Alternatively, described task distribution formula processing means also includes: status poll unit, is suitable in the distribution of described task single
Unit is assigned to the task that described service request is pointed in described peer-to-peer network at least one other application being in idle condition
After processing at node, and described result receiving unit receive from described at least one be in idle condition
Before the task result of other application nodes feedback, whether each application node that inquiry is assigned to described task exits sky
Not busy state；If so, described task allocation unit will move out the task distribution that the application node of idle condition undertakes to being in the free time
Other application nodes of state.
Alternatively, described task allocation unit includes: task splits subelement, is suitable to appointing that described service request is pointed to
Business splits, and described task fractionation subelement is split the subtask obtaining and is assigned to described equity by described task allocation unit
In network, at least one is in and processes at other application nodes of idle condition.
Alternatively, each application node in described peer-to-peer network has node address；Described request reception unit includes
Address records subelement, is suitable to the node address that record proposes the application node of described service request；Described task allocation unit
According to the node address of other application nodes being in idle condition, described task is allocated；Described result feedback
Described task result, according to the node address of the application node proposing described service request, is fed back to propose described clothes by unit
The application node of business request.
Alternatively, described task distribution formula processing means also includes: feedback reception unit, and being suitable to please in the described service of proposition
After the application node asked receives described task result, receive and propose the task that the application node of described service request sends
The feedback of completion status.
For solving above-mentioned technical problem, the embodiment of the present invention also provides a kind of Cloud Server, including above-described task
Distributed processing arrangement.
Alternatively, described Cloud Server is P2P server.
Compared with prior art, the technical scheme of the embodiment of the present invention has the advantages that
Embodiment of the present invention task distribution formula processing method may include that the service of the application node receiving in peer-to-peer network
Request, be assigned to the task that described service request is pointed in described peer-to-peer network at least one be in other of idle condition should
Process with node, after at least one other application node being in idle condition described complete task process, receive
The task result fed back from least one other application node being in idle condition described；By described task result
Feed back to propose the application node of described service request.The present embodiment uses the application node in peer-to-peer network as the place of task
Reason core, in peer to peer environment, all in reciprocity status between multiple application nodes of being connected to each other, each applies joint
Point has identical function, and without master-slave, an application node can not only be used for server, sets and shares in resource confession network other
Application node is used, again can be as work station, and whole network is independent of special centralized servers, does not also have special work
Stand.Therefore the slack resources in peer-to-peer network can be coordinated to get up by the embodiment of the present invention, on the one hand will not increase any firmly
Part cost puts into, and on the other hand owing to the application node in peer-to-peer network is distribution, can improve security and the guarantor of data
Close property.
Further, after the task that distribution described service request is pointed to, each that be assigned to described task can be inquired about
Whether application node exits from idle status；If so, will move out the task distribution that the application node of idle condition undertakes to being in sky
Other application nodes of not busy state；And when task is allocated, it is however generally that, described task can be distributed to numerous
Being in other application nodes of idle condition, for example, can being allocated to thousand of application nodes, this makes when some application joint
Point exits from idle status, and still has substantial amounts of application node can process described task.Further, it is also possible to by described service request
Pointing to of task splits, and in the subtask obtaining fractionation is assigned to described peer-to-peer network, at least one is in idle condition
Other application nodes at process, task big for operand can rationally be split by this task subdivision mode so that
Task after must being split can be completed by more efficiently processing, and improves task treatment effeciency.
Brief description
Fig. 1 is the flow chart of the embodiment of the present invention a kind of task distribution formula processing method.
Fig. 2 is the topology diagram of a kind of Cloud Server of the embodiment of the present invention and multiple application node.
Fig. 3 is the flow chart of the another kind of task distribution formula processing method of the embodiment of the present invention.
Fig. 4 is the schematic block diagram of the embodiment of the present invention a kind of task distribution formula processing means.
Fig. 5 is the schematic block diagram of the another kind of task distribution formula processing means of the embodiment of the present invention.
Detailed description of the invention
As described in the background section, can provide cloud service at present is that solid financial strength, hardware foundation are strong mostly
Big operator, for a user, the cost on the one hand rented is higher, and for another aspect, the specification rented also has very
Many restrictions.Therefore, the use of prior art Cloud Server price for a user is costly, and it cannot be guaranteed that server resource
It is used effectively.
For techniques discussed above problem, the embodiment of the present invention proposes a kind of task distribution formula processing method, described
Business distributed approach goes for Cloud Server, by receiving the service request of the application node in peer-to-peer network, and will
The task that described service request is pointed to is assigned in described peer-to-peer network at least one other application node being in idle condition
Process, complete after task processes, to receive from described at least one other application node being in idle condition described
At least one is in the task result of other application nodes feedback of idle condition, feeds back to described task result
Propose the application node of described service request, use the application node in peer-to-peer network as the process core of task, entirely
During, described Cloud Server is only completed the distribution of task and the reception of task result and feedback, is not involved in taking office completely
Therefore Cloud Server own resources are taken very little by the process of business, the quantity of the application node in peer-to-peer network
Increase and the expansion of network size, the disposal ability to task for the described Cloud Server can unrestrictedly increase in theory, permissible
Slack resources in peer-to-peer network is coordinated to get up, any hardware cost will not be increased and put into, thus realize a kind of with low cost
And the cloud service technology that resource is used effectively.
For enabling above-mentioned purpose, feature and the beneficial effect of the present invention to become apparent from understandable, below in conjunction with the accompanying drawings to this
The specific embodiment of invention is described in detail.
Fig. 1 is the flow chart of the embodiment of the present invention a kind of task distribution formula processing method.Fig. 2 is a kind of Cloud Server and many
The topology diagram of individual application node.Below in conjunction with Fig. 1 and Fig. 2, task distribution formula processing method is illustrated.
The present embodiment task distribution formula processing method goes for Cloud Server 10.Described task distribution formula processing method
Step S101 can be included to step S105.
Step S101, the service receiving the application node in peer-to-peer network is asked.
Step S103, in the task that described service request is pointed to is assigned to described peer-to-peer network, at least one is in the free time
Process at other application nodes of state.
Step S104, after at least one other application node being in idle condition described complete task process, receives
The task result fed back from least one other application node being in idle condition described.
Described task result is fed back to propose the application node of described service request by step S105.
As in figure 2 it is shown, n application node in Cloud Server 10 and peer-to-peer network (the 3rd, saves with node the 1st, node the 2nd, node
The 4th, node the 5th, node the 6th, node the 7th, node is the 8th, for point ..., node n illustrates) an internet system constituting, wherein n is just whole
Number, and value is very big, therefore, in actual applications, sufficient amount of application node can be had in n application node to remain sky
Not busy state.
Use and a kind of system resource allocation coordination on the Cloud Server 10 of described task distribution formula processing method, can be run
Program, can perform shown step S101 successively to step S105.In peer to peer environment, the multiple application being connected to each other saves
All in reciprocity status between point, each application node has identical function, and without master-slave, an application node both can be made
For server, the shared resource of setting, again can be as work station for other application nodes institutes in network, and whole network is general
For be independent of special centralized servers, there is no special work station yet.N the application joint being additionally, since in peer-to-peer network
Point uses distributed topological structure, can improve security and the confidentiality of data.
Fig. 3 is the flow chart of the another kind of task distribution formula processing method of the embodiment of the present invention.Below in conjunction with Fig. 1 to Fig. 3 pair
The detailed description of the invention of described task distribution formula processing method is described in detail.
In being embodied as, each application node (node 1 to node n) in described peer-to-peer network has node address.
The service request receiving application node in described step S101 can include step S1011, and record proposes described service request
The node address of application node.
The application node that described task result feeds back in described step S104 described proposition service request is permissible
Including step S1041, according to the node address of the application node proposing described service request, described task result is fed back
To the application node proposing described service request.
Described step S102 is assigned in described peer-to-peer network the task that described service request is pointed at least one
Carry out process and can include step S1021 at other application nodes of idle condition, according to be in idle condition other should
With the node address of node, described task is allocated.
It in being embodied as, is assigned to the task that described service request is pointed in described peer-to-peer network in step s 102
At least one is in after processing at other application nodes of idle condition, and receive in step s 103 from described extremely
Before the task result of few other an application nodes feedback being in idle condition, described task distribution formula processing method
Can also include step S105, whether each application node that inquiry is assigned to described task exits from idle status.
If so, the task distribution that the application node of idle condition undertakes can with step S106, be will move out to being in sky
Other application nodes of not busy state.For a cloud service, relating in service of task typically will use district when distribution
Territory water flooding enters Mobile state distribution.Should it is said that in general, described task can be distributed to numerous other of idle condition of being in
With node, for example, can be allocated to thousand of application nodes, this makes to exit from idle status when some application node, still has
Substantial amounts of application node can process described task.For example, node 1 to node 8 is assigned with a task by Cloud Server 10, this
Described task is processed by 8 nodes, and in processing procedure, node 4 and node 8 have exited suddenly idle condition, then, this
When Cloud Server 10 coordinate other application nodes respective handling carried out to described task.
If it is not, task that service request is pointed to can be continued in peer-to-peer network at least one with step S107
Other application nodes distribution in idle condition；Then step S103 can be continued executing with.
It should be noted that in the present embodiment, application node is in idle condition and refers to described application node and do not hold
The row task of itself, but untreated any task, or only process the described service request of described Cloud Server 10 distribution
Pointing to of task.
In being embodied as, the described task by described service request sensing is assigned in described peer-to-peer network at least one
It is at other application nodes of idle condition and carries out process and include: the task that described service request is pointed to is split, will
Split the subtask that obtains to be assigned in described peer-to-peer network at least one and be in and carry out at other application nodes of idle condition
Process (not shown).Task big for operand can rationally be split by this task subdivision mode, so that after being split
Task can be completed by more efficiently processing, and improves task treatment effeciency.
In being embodied as, described task distribution formula processing method can also include step S108, is proposing described service
After the application node of request receives described task result, reception proposes appointing of the application node transmission of described service request
The feedback of business completion status.
Fig. 4 is the schematic block diagram of the embodiment of the present invention a kind of task distribution formula processing means.
As shown in Figure 4, the embodiment of the present invention is also disclosed a kind of task distribution formula processing means 100, described task distribution formula
Processing means 100 can include request reception unit the 101st, task allocation unit the 102nd, result receiving unit 103 and process
Result feedback unit 104.
Wherein, described request reception unit 101 is suitable to receive the service request of the application node in peer-to-peer network.
Described task allocation unit 102 is suitable to be assigned in described peer-to-peer network extremely the task that described service request is pointed to
Process at few other application nodes being in idle condition.
Described result receiving unit 103 be suitable to described at least one to be in other application nodes of idle condition complete
After one-tenth task is processed, the task from least one other application nodes feedback being in idle condition described that receives processes knot
Really.
Described result feedback unit 104 is suitable to feed back to propose described service request by described task result
Application node.
Fig. 5 is the schematic block diagram of the another kind of task distribution formula processing means of the embodiment of the present invention.
As shown in Figure 4 and Figure 5, in being embodied as, described task distribution formula processing means 100 can also include that state is looked into
Asking unit 105, described status poll unit 105 was suitable to appointing that described service request is pointed in described task allocation unit 102
Business is assigned in described peer-to-peer network after at least one is in and processes at other application nodes of idle condition, and in institute
State result receiving unit 103 and receive feeding back from least one other application node being in idle condition described of task
Before result, whether each application node that inquiry is assigned to described task exits from idle status.
If so, the distribution of task that the application node that described task allocation unit 102 will move out idle condition undertakes is to being in
Other application nodes of idle condition.
In being embodied as, described task allocation unit 102 can include task split subelement (not shown), be suitable to by
The task that described service request is pointed to splits, and described task is split subelement by described task allocation unit 102
To subtask be assigned in described peer-to-peer network at least one and be at other application nodes of idle condition and process.
In being embodied as, each application node in described peer-to-peer network can have node address.
In being embodied as, described request reception unit 101 includes address record subelement (not shown), is suitable to record and carries
Go out the node address of the application node of described service request.
Described task allocation unit 102 according to the node address of other application nodes being in idle condition to described task
It is allocated.
Described result feedback unit 104 is according to the node address of the application node proposing described service request, by institute
The task result of stating feeds back to propose the application node of described service request.
In being embodied as, embodiment of the present invention task distribution formula processing means 100 can also include feedback reception unit
106, be suitable to, after the application node proposing described service request receives described task result, receive and propose described service
The feedback of the task completion status that the application node of request sends.
The more information of described task distribution formula processing means 100 refer in above example to described task distribution formula
The associated description of processing method, here is omitted.
The embodiment of the present invention is also disclosed a kind of Cloud Server, and described Cloud Server can include described task distribution formula process
Device 100；Described task distribution formula processing method can be performed on described terminal device.
Specifically, described Cloud Server can be P2P server.Furthermore, P2P server can be peer-to-peer network
Any one application node in network.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is can
Completing to instruct related hardware by program, this program can be stored in computer-readable recording medium, and storage is situated between
Matter may include that ROM, RAM, disk or CD etc..
Although present disclosure is as above, but the present invention is not limited to this.Any those skilled in the art, without departing from this
In the spirit and scope of invention, all can make various changes or modifications, therefore protection scope of the present invention should be with claim institute
Limit in the range of standard.
Claims (12)
1. a task distribution formula processing method, it is characterised in that include:
The service receiving the application node in peer-to-peer network is asked；
Be assigned to the task that described service request is pointed in described peer-to-peer network at least one be in other of idle condition should
Process at node；
After at least one other application node being in idle condition described complete task process, receive from described at least one
The task result of individual other application nodes feedback being in idle condition；
Described task result is fed back to propose the application node of described service request.
2. task distribution formula processing method according to claim 1, it is characterised in that described service request is referred to described
To task be assigned in described peer-to-peer network after at least one is in and processes at other application nodes of idle condition,
And receiving before the task result that at least one other application node being in idle condition described feeds back, also wrap
Include:
Whether each application node that inquiry is assigned to described task exits from idle status；
If so, will move out the task that the application node of idle condition undertakes to distribute to other application nodes being in idle condition.
3. task distribution formula processing method according to claim 1, it is characterised in that described by described service request sensing
Task be assigned in described peer-to-peer network at least one and be at other application nodes of idle condition and carry out process and include:
Splitting the task that described service request is pointed to, the subtask obtaining fractionation is assigned in described peer-to-peer network extremely
Process at few other application nodes being in idle condition.
4. task distribution formula processing method according to claim 1, it is characterised in that each in described peer-to-peer network should
Having node address with node, the service request of described reception application node includes: record proposes the application of described service request
The node address of node；
The described application node that described task result feeds back to described proposition service request includes: according to the described clothes of proposition
Described task result is fed back to propose the application joint of described service request by the node address of the application node of business request
Point；
It described is assigned to the task that described service request is pointed in described peer-to-peer network at least one and is in its of idle condition
He carries out process and includes at application node: enter described task according to the node address of other application nodes being in idle condition
Row distribution.
5. task distribution formula processing method according to claim 1, also includes: proposing the application joint of described service request
After point receives described task result, receive the task completion status of the application node transmission proposing described service request
Feedback.
6. a task distribution formula processing means, it is characterised in that include:
Request reception unit, is suitable to receive the service request of the application node in peer-to-peer network；
Task allocation unit, in being suitable to the task that described service request is pointed to is assigned to described peer-to-peer network, at least one is in
Process at other application nodes of idle condition；
Result receiving unit, is suitable to complete task process at least one other application node being in idle condition described
After, receive the task result fed back from least one other application node being in idle condition described；
Result feedback unit, is suitable to feed back to propose by described task result the application node of described service request.
7. task distribution formula processing means according to claim 6, it is characterised in that also include:
Status poll unit, is suitable to, in described task allocation unit, the task that described service request is pointed to is assigned to described equity
After in network, at least one is in and processes at other application nodes of idle condition, and receive single in described result
Unit receives before the task result that at least one other application node being in idle condition described feeds back, inquiry point
Whether each application node being fitted on described task exits from idle status；
If so, described task allocation unit will move out the task distribution that the application node of idle condition undertakes to being in idle condition
Other application nodes.
8. task distribution formula processing means according to claim 6, it is characterised in that described task allocation unit includes:
Task splits subelement, is suitable to split the task that described service request is pointed to, and described task allocation unit is by institute
Task of stating splits subelement and splits the subtask that obtains and be assigned in described peer-to-peer network at least one and be in its of idle condition
He is processed at application node.
9. task distribution formula processing means according to claim 6, it is characterised in that each in described peer-to-peer network should
With node, there is node address；
Described request reception unit includes address record subelement, is suitable to the joint that record proposes the application node of described service request
Dot address；
Described task is carried out point by described task allocation unit according to the node address of other application nodes being in idle condition
Join；
Described result feedback unit is according to the node address of the application node proposing described service request, at described task
Reason result feeds back to propose the application node of described service request.
10. task distribution formula processing means according to claim 6, it is characterised in that also include:
Feedback reception unit, is suitable to, after the application node proposing described service request receives described task result, connect
Receive the feedback of the task completion status of the application node transmission proposing described service request.
11. 1 kinds of Cloud Servers, it is characterised in that include that the task distribution formula described in any one of claim 6 to 10 processes dress
Put.
12. Cloud Servers according to claim 11, it is characterised in that described Cloud Server is P2P server.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610596889.3A CN106161643B (en) | 2016-07-25 | 2016-07-25 | Task distribution formula processing method, device and Cloud Server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610596889.3A CN106161643B (en) | 2016-07-25 | 2016-07-25 | Task distribution formula processing method, device and Cloud Server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106161643A true CN106161643A (en) | 2016-11-23 |
| CN106161643B CN106161643B (en) | 2019-09-06 |
Family
ID=58060184
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610596889.3A Active CN106161643B (en) | 2016-07-25 | 2016-07-25 | Task distribution formula processing method, device and Cloud Server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106161643B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106940662A (en) * | 2017-03-17 | 2017-07-11 | 上海传英信息技术有限公司 | A kind of multi-task planning method of mobile terminal |
| CN107688496A (en) * | 2017-07-24 | 2018-02-13 | 上海壹账通金融科技有限公司 | Task distribution formula processing method, device, storage medium and server |
| CN108446172A (en) * | 2018-02-26 | 2018-08-24 | 平安普惠企业管理有限公司 | Data transfer method, apparatus, computer equipment and storage medium |
| CN110636120A (en) * | 2019-09-09 | 2019-12-31 | 广西东信易联科技有限公司 | Distributed resource coordination system and method based on service request |
| CN111314401A (en) * | 2018-12-12 | 2020-06-19 | 百度在线网络技术（北京）有限公司 | Resource allocation method, device, system, terminal and computer readable storage medium |
| CN112398893A (en) * | 2019-08-19 | 2021-02-23 | 深圳市优必选科技股份有限公司 | Robot data processing method and robot |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101340331A (en) * | 2007-07-06 | 2009-01-07 | 中国电信股份有限公司 | Method for executing system task by idle terminal in P2P network |
| CN103152428A (en) * | 2013-03-19 | 2013-06-12 | 汉柏科技有限公司 | Method for carrying out service communication among nodes on cloud platform |
| CN103336719A (en) * | 2013-06-04 | 2013-10-02 | 江苏科技大学 | Distribution rendering system and method in P2P mode |
| CN104935640A (en) * | 2015-05-07 | 2015-09-23 | 上海逸云信息科技发展有限公司 | P2P acceleration content distribution network system and method |
-
2016
- 2016-07-25 CN CN201610596889.3A patent/CN106161643B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101340331A (en) * | 2007-07-06 | 2009-01-07 | 中国电信股份有限公司 | Method for executing system task by idle terminal in P2P network |
| CN103152428A (en) * | 2013-03-19 | 2013-06-12 | 汉柏科技有限公司 | Method for carrying out service communication among nodes on cloud platform |
| CN103336719A (en) * | 2013-06-04 | 2013-10-02 | 江苏科技大学 | Distribution rendering system and method in P2P mode |
| CN104935640A (en) * | 2015-05-07 | 2015-09-23 | 上海逸云信息科技发展有限公司 | P2P acceleration content distribution network system and method |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106940662A (en) * | 2017-03-17 | 2017-07-11 | 上海传英信息技术有限公司 | A kind of multi-task planning method of mobile terminal |
| CN107688496A (en) * | 2017-07-24 | 2018-02-13 | 上海壹账通金融科技有限公司 | Task distribution formula processing method, device, storage medium and server |
| CN108446172A (en) * | 2018-02-26 | 2018-08-24 | 平安普惠企业管理有限公司 | Data transfer method, apparatus, computer equipment and storage medium |
| CN111314401A (en) * | 2018-12-12 | 2020-06-19 | 百度在线网络技术（北京）有限公司 | Resource allocation method, device, system, terminal and computer readable storage medium |
| CN112398893A (en) * | 2019-08-19 | 2021-02-23 | 深圳市优必选科技股份有限公司 | Robot data processing method and robot |
| CN112398893B (en) * | 2019-08-19 | 2023-07-18 | 深圳市优必选科技股份有限公司 | Method for processing data by robot and robot |
| CN110636120A (en) * | 2019-09-09 | 2019-12-31 | 广西东信易联科技有限公司 | Distributed resource coordination system and method based on service request |
| CN110636120B (en) * | 2019-09-09 | 2022-02-08 | 广西东信易联科技有限公司 | Distributed resource coordination system and method based on service request |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106161643B (en) | 2019-09-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106161643A (en) | Task distribution formula processing method, device and Cloud Server | |
| CN103812882B (en) | A kind of method and system of file transmission | |
| US20130254761A1 (en) | Granular application sessions tagging | |
| CN106101232A (en) | Load-balancing method and device | |
| JP2024079760A (en) | Cloud service for cross-cloud operations | |
| CN104253850A (en) | Distributed task scheduling method and system | |
| CN108563697A (en) | A kind of data processing method, device and storage medium | |
| CN101808051A (en) | Application integration gateway and control method thereof | |
| CN105227595A (en) | A kind of message method and equipment | |
| CN104408552A (en) | Method, device and system for cooperatively processing task | |
| CN105184501A (en) | Efficient asynchronous order processing method | |
| CN104484167B (en) | Task processing method and device | |
| CN107888700B (en) | Shared cloud rendering system and processing method thereof | |
| CN110691042A (en) | Resource allocation method and device | |
| CN107528708A (en) | A kind of method and system for arranging Linux server cluster | |
| CN103503413A (en) | Method and device for transmitting network information | |
| CN103581273A (en) | Service executing method, device and system for distributed system | |
| CN105262839A (en) | Remote logging method for specified terminal in mode of load balancing | |
| CN106302400A (en) | The processing method and processing device of access request | |
| CN104796388B (en) | A kind of method that the network equipment is scanned, relevant apparatus and system | |
| CN105188087A (en) | Business communication method and system based on short message gateway | |
| CN108156194A (en) | A kind of form data processing method | |
| CN103152428A (en) | Method for carrying out service communication among nodes on cloud platform | |
| CN114466000B (en) | CDN gateway source returning method and device | |
| JP2009064476A5 (en) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220921 Address after: 212003 No. two, 24 village, Taohuawu, Jiangsu, Zhenjiang Patentee after: Jiangsu Huitong Group Co.,Ltd. Patentee after: ZHENJIANG HUITONG ELECTRONICS Co.,Ltd. Address before: 212003 No. two, 24 village, Taohuawu, Jiangsu, Zhenjiang Patentee before: ZHENJIANG HUITONG ELECTRONICS Co.,Ltd. |
|
| TR01 | Transfer of patent right |