CN106302170A - A kind of resource allocation methods of wireless cloud computing system - Google Patents
A kind of resource allocation methods of wireless cloud computing system Download PDFInfo
- Publication number
- CN106302170A CN106302170A CN201610842392.5A CN201610842392A CN106302170A CN 106302170 A CN106302170 A CN 106302170A CN 201610842392 A CN201610842392 A CN 201610842392A CN 106302170 A CN106302170 A CN 106302170A
- Authority
- CN
- China
- Prior art keywords
- task
- pcp
- section
- cloud computing
- path
- 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
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the resource allocation methods of a kind of wireless cloud computing system, the priority of each task node in calculation workflow by the way of calculating longest path, then PCP is found by priority, obtain some the PCP sections having sequencing, in order each section of PCP is mapped in the middle of AP in local optimum mode, when connection does not but need data transmission between certain is to AP, route data to other AP, indirectly complete transmission.The present invention mapping process by PCP, completes the mapping process to task, and task of making relatedness stronger during this is allocated in the middle of same AP, decreases the transmission time of data between task.Secondly, the assigning process of PCP take into account and allow the mapping of PCP to AP more equalize, and for the situation of not full UNICOM between AP in radio communication, it is provided with routing algorithm, some AP are coupled together, it is allowed to cooperation get up to process a workflow, decreases the process time of single workflow, improve systematic function.
Description
Technical field
The present invention relates to radio communication, multiple AP cooperation is called by a kind of wireless thin cloud system, is allowed to common
Process the resource allocation methods of the wireless cloud computing system of workflow.
Background technology
Desktop Computing mode is developed into mobile meter by the appearance of intelligent mobile terminal (Smart Mobile Device, SMD)
Calculation mode, the development of distributed computing system brings mobile cloud computing for us again.The concept of mobile computing is by traditional table
Face calculates and develops, and the equipment that conventional desktop relates in calculating includes the equipment that the position such as desk computer, server is fixing,
Wired connection between equipment, is powered by power supply, and communication link is stable, it is achieved that basic data access, the purpose of resource-sharing,
But user is limited in an office by the characteristic that device location is fixed.
Meanwhile, in other respects, moving cloud computing also has certain problems demand to solve.First, intelligent mobile terminal is visited
Ask that the communication delay of far-end cloud computing center is longer, and be difficult to estimate, reduce Consumer's Experience, especially to strong the answering of interactivity
The biggest with impact；On the other hand, the shift module of Mobile solution arrives cloud computing center through complicated Internet network
During, safety and the privacy of user data can not be guaranteed；And improve number by the encryption technology complicated in transmitting terminal application
According to safety, can give and originally bigger calculating pressure be brought with regard to resource-constrained Intelligent mobile equipment；The safety problem of data is also same
Sample there will be cloud computing center, and large-scale cloud computing center is easier to be attacked.
For problem present in mobile cloud computing, the concept of thin cloud is suggested, and thin cloud is by Intelligent mobile equipment periphery
One or more resourceful computers form, it is intended to minimum security risk, the shortest load transfer distance, and minimum
Communication delay strengthens the performance of Intelligent mobile equipment.
Prior art immediate with the present invention i.e. document Abrishami S, Naghibzadehand M, J.Eperma D
H.“Deadline-constrained workflow scheduling algorithms for Infrastructure as
a Service Clouds”,Future Generation Computer Systems,vol.29,no.1,pp.158-169,
2013, in the publication, give finding method and the distribution method of IC-PCP, the PCP distribution method in the present invention is different from
The method, is that IC-PCP is revised the algorithm obtained, and channel strip when between AP Jian Feiquan UNICOM or AP by a kind of combination HEFT algorithm
The when that width being less, in this paper, method will be the most applicable, and those skilled in the art cannot to solve it according to general knowledge inapplicable
Defect, this patent is for above-mentioned sight, it is proposed that a kind of new PCP allocative decision, make the load of AP more tend to equilibrium and
The problem that AP Jian Feiquan UNICOM brings can be solved by a route to be valid.
Summary of the invention
Goal of the invention: the defect existed for above-mentioned prior art, it is desirable to provide a kind of wireless cooperation thin cloud system
The resource regulating method of system, by the cooperative scheduling by some AP, is allowed to be jointly processed by a workflow, decreases single work
The average handling time of stream, improves systematic function.Meanwhile, by the distribution of resource, the equilibrium of load makes the utilization of resource
Rate increases.
Technical scheme: the resource allocation methods of a kind of wireless cloud computing system, comprises the following steps:
(1) the task n task node weights of calculation workflow and task n take office the weights on m limit；
(2) priority of each task is calculated；
(3) finding task n that residue task medium priority is the highest, PCP is initialized by n.If the rear-guard task of task n
There is r, respectively m1, m2 ..., mr；
(4) m1, m2 are removed ..., in mr, forerunner is the most all assigned to the task of any PCP section, takes in remaining task
The task of priority value maximum adds this section of PCP, and distribution always is gone down, until there is no qualified task, and this section of PCP distribution
Complete；
(5) check the task in this section of PCP one by one, complete the distribution of new one section of PCP, until all of task is the most allocated
To PCP section；
(6) if there is no AP can be distributed, then it is set to distribute by all of AP, finds the AP that can distribute PCP section, meter
Calculate the EFT that the distribution of PCP section extremely can distribute AP, compare the EFT that one section of PCP can distribute in AP at each, choose and make EFT have minimum
The AP of value is as the mapping AP of this section of PCP；
(7) during choosing, choose EFT that AP obtains when being infinite, analyze the task in this section of PCP one by one, if
The forerunner of task is infinite to this multiplexed transport time, route；
(8) determine starting point AP and terminal AP, then find out the path being connected two AP by the shortest jumping figure, this path is made
For routed path.
Further, task n task node weights described in step (1) are the task process time delay of this nodeWherein I is the task amount of task,Processing speed for average each AP；Described task n takes office the weights on m limit
For transmission delayWherein Transferdata is the task amount of transmission between task,For flat between AP
All bandwidth of link.
Further, described step (2) is particularly as follows: calculate each task node to the n that ends taskexitLongest path
Value, using this value as the priority of each task.
Further, each task node is calculated to the n that ends taskexitThe method of longest path particularly as follows: set n and appoint
The rear-guard task of business has r, respectively m1,m2,...,mr, then the priority of task n isWherein initialization
I.e. ending task nexitPriorityIexitTask amount for the task that ends up.
Further, step (4), particularly as follows: assume two set α and β, is put into inside α and has been assigned to appointing of PCP
Business, puts into the unallocated task to PCP in β, the initial value of α is an empty set, afterwards according to the order of priority rank, finds
PCP section；For m1,m2,...,mrMiddle task mi, wherein miAll of predecessor task have q, respectively l1,l2,...,lq, as
Really l1,l2,...,lqThe most in α, then miRetained, and continued distribution, until there is no qualified task, this section
PCP is assigned.
Further, step (5) is particularly as follows: the task of checking one by one in this section of PCP, if the task in this section of PCP
The forerunner that there is this task in rear-guard task all distributes the task to PCP, then start to be allocated next section of PCP, directly
All it is assigned in PCP section to all of task.
Further, described step (8) is particularly as follows: set and need to carry out the initial AP that route as APfrom, the terminal AP of route
For APtoIf jumping through one and increase jumping figure, finding out APfromThe AP that can arrive, if in the middle of there is no APto, then route is continually looked for
Path, finds out double bounce APfromThe AP that can arrive, if the most still not having APto, then continue to increase jumping figure, can until finding out
To arrive APtoPath till, using this path as routed path.
Beneficial effect: first, the present invention proposes the task method of salary distribution of a kind of Based PC P, by the mapping of PCP
Journey, completes the mapping process to task, and task of making relatedness stronger during this is allocated in the middle of same AP, decreases task
Between transmission time of data.Secondly, take into account in the assigning process of PCP and allow the mapping of PCP to AP more equalize, with
Toward the PCP method of salary distribution in, the when of excessively little of the channel width between AP, if according to optimum selection mode, can
Some AP can be caused forever to distribute less than PCP, and the present invention can not distribute two kinds of shapes by forcing to be set to distribute by AP
State, it is to avoid this situation.Finally, the present invention is directed in radio communication the situation of not full UNICOM between AP, be provided with route
Some AP are coupled together by algorithm, are allowed to cooperation and get up to process a workflow, decrease the process time of single workflow,
Improve systematic function.
Accompanying drawing explanation
Fig. 1 is that mobile cooperation thin cloud calculates scheduling mode schematic diagram；
Fig. 2 is 10 workflow diagrams；
Fig. 3 is the resource allocation methods flow chart of this wireless cloud computing system；
Fig. 4 is task priority flow chart in step 1～2 calculation workflow；
Fig. 5 is that step 3～5 finds PCP flow chart；
Fig. 6 is step 6～8PCP is mapped to AP and finds routed path flow chart.
Detailed description of the invention
Below by a most preferred embodiment and combine accompanying drawing the technical program is described in detail.
All forerunners that in task flow, task has certain sequencing, all of task to have to wait for it are carried out complete
Just can perform, then we need setting priority to remove the execution sequence of measurement task.In task to AP (Wireless
Access Point) mapping process in the middle of, can be can to distribute at same PCP by having certain contextual task
In (Partial Critical Path) section, it is positioned at the task in same section of PCP and is necessarily allocated in same AP, then this section of PCP
The interior data transmission period between task is 0, is so assigned to AP by PCP and decreases the total amount of data of transmission between AP.Upper
State in PCP mapping process, need to consider two conditions, on the one hand, wish that each PCP section is distributed in AP more evenly, can
More equalize with proof load, on the other hand, need PCP to choose the AP of local optimum so that it is to be done within the shorter time.
When depositing the situation of Fei Quan UNICOM between the aps, the data between task cannot directly arrive, and needs the AP by being routed to other
The transmission of complete paired data.
As it is shown in figure 1, the resource allocation methods of a kind of wireless cloud computing system, comprise the following steps:
(1) Mobile solution is broken down into multiple task block, has data dependence relation between task, forms a job
Stream, as in figure 2 it is shown, as a example by a simple workflow, wherein there are corresponding weights, first calculation workflow in the inside of workflow
Task n task node weights and task n take office the weights on m limit；Task n task node weights are that the task process of this node is prolonged
TimeWherein I is the task amount of task,Processing speed for average each AP；Described task n takes office the power on m limit
Value is transmission delayWherein Transferdata is the task amount of transmission between task,For between AP
The bandwidth of average link.
(2) priority of each task is calculated, particularly as follows: calculate each task node to the n that ends taskexitThe longest
The value in path, using this value as the priority of each task.Calculate each task node to the n that ends taskexitLongest path
The method in footpath particularly as follows: the rear-guard task setting n task has r, respectively m1,m2,...,mr, then the priority of task n is Wherein initialization
I.e. ending task nexitPriorityIexitTask amount for the task that ends up.
As shown in Figure 4, search for the most forward by ending task, when the priority of the rear-guard task of a task known it
After, can be in the hope of the value of the priority of this task.We assume that there is a set x, wherein put into the volume task of known priority,
The priority of the task that first ends up can be asked, and puts it in x and initializes, and for all tasks in set x, finds out these tasks
Forerunner, duplicate removal is also put in set temp, is analyzed the task in temp the most one by one, if all rear-guard tasks of this task
All in x, this task is retained, then by with upper type, in temp, the priority of task can be asked, and updates task in x simultaneously,
Proceed as described above, until all of task is all in set x.
(3) as it is shown in figure 5, find task n that residue task medium priority is the highest, n is firstly added in this section of PCP, i.e. n pair
PCP initializes, if its rear-guard task has r, and respectively m1, m2 ..., mr；
(4) m1, m2 are removed ..., in mr, forerunner is the most all assigned to the task of any PCP section, takes in remaining task
The task of priority value maximum adds this section of PCP, and distribution always is gone down, until there is no qualified task, and this section of PCP distribution
Complete；Particularly as follows: assume two set α and β, inside α, put into the task of being assigned to PCP, put in β unallocated extremely
The task of PCP, the initial value of α is an empty set, afterwards according to the order of priority rank, finds PCP section；For m1,
m2,...,mrMiddle task mi, wherein miAll of predecessor task have q, respectively l1,l2,...,lqIf, l1,l2,...,
lqThe most in α, then miRetained, and continued distribution, until not having qualified task, this section of PCP to be assigned.
(5) check the task in this section of PCP one by one, complete the distribution of new one section of PCP, until all of task is the most allocated
To PCP section；Particularly as follows: checking one by one in this section of PCP of task, if there is this task in the rear-guard of the task in this section of PCP
Forerunner all distribute the task to PCP, then start new one section of PCP and be allocated, repeat above procedure set up new PCP section
Until all of task is all assigned in PCP section α.
(6) as shown in Figure 6, by previous step, have found each section of PCP, the most in order, each section of PCP is mapped
To AP.If there is no AP can be distributed, then it is set to distribute by all of AP, finds the AP that can distribute PCP section, calculate
The distribution of PCP section extremely can distribute the EFT (Estimated Finish Time) of AP, compares one section of PCP and can distribute in AP at each
EFT, chooses the AP mapping AP as this section of PCP of the value making EFT have minimum；
Concrete: for an AP, it has two states to distribute and can not distribute.As an AP that can distribute state
After being allocated to certain PCP, dress is become distributing by its state.So PCP is distributed down always, until all
AP when all becoming indistributable state, by the state reduction of all AP for distributing, proceed the mapping of PCP afterwards
Process.For one section of PCP, using the EFT of this section of last task of PCP as the EFT of this section of PCP, exist by comparing one section of PCP
Each can distribute the EFT in AP, chooses and makes AP minimum for its EFT as selecting AP.Assume for task m, all of forerunner of m
Task has q, is set to l1, l2 ..., lq, task m is allocated in APi, cuts and is now already allocated to the task of APi and has k, respectively
For t1, t2 ..., tk, then, shown in the EFT of task m such as formula (2), wherein EST (Estimated Start Time) is expressed as
Formula (3), in formula, (3) RRT (Resource Ready Time) is expressed as formula (4), TRT (TAsk Ready Time) table
Being shown as formula (5), wherein formula (5) needs illustratively, distributes same AP's when there being two tasks front and back driving relation
Time, between two tasks, data transmission period i.e. TT is 0.The EFT of PCP task is then gradually tried to achieve by above formula,
The EFT of this section of PCP can be obtained.
EFT (m)=EST (m)+ETm (2)
EST (m)=max{RRT (APi),TRT(m)} (3)
RRT(APi)=max{EFT (t1),EFT(t2),...,EFT(tk)} (4)
(7) during choosing, choose EFT that AP obtains when being infinite, need to carry out routeing to reach the transmission of data,
Now, this section of PCP has chosen AP to be distributed.First, analyze the task in this section of PCP one by one, if before task
It is infinite for being driven to this multiplexed transport time, then find two AP that cannot be directly connected to, and finds routed path, route；
(8) determine starting point AP and terminal AP, then find out the path being connected two AP by the shortest jumping figure, this path is made
For routed path；If needing the initial AP carrying out routeing is APfrom, the terminal AP of route is APtoIf jumping to increase through one and jumping
Number, finds out APfromThe AP that can arrive, if in the middle of there is no APto, then continually look for routed path, find out double bounce APfromPermissible
The AP arrived, if the most still not having APto, then continue to increase jumping figure, repeating said process, AP can be arrived until finding outto
Path till, using this path as routed path.
Here in Fig. 2 10 workflows are given one example.Assume for 10 workflows, its structure such as Fig. 2 institute
Show, concrete parameter is provided below, it is assumed that processing speed P of each AP is 10000MIPS (Million Instruction
Per Second), thenIn data transmission procedure, if between AP, bandwidth B is all 106bit/s, thenThe task amount I that its task number is corresponding is as shown in table 1, and its unit is MI (Million Instruction).
Table 1 task amount
| Task number | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| Task amount | 0 | 1339000 | 1383000 | 1336000 | 1378000 | 1037000 | 1059000 | 1088000 | 1755000 | 0 |
Between its task, data volume Transferdata of transmission is as shown in table 2, and data volume unit is bit.
Data volume Transferdata of transmission between table 2 task
Assuming there are 4 AP, its UNICOM's situation is as shown in table 5, and wherein the value in table is this path UNICOM of 1 expression, is 0 expression
Not UNICOM, such as, what in form, the 2nd row the 3rd arranged is numbered 1, represents from AP1 to AP2 UNICOM.
Annexation between table 3AP
| No. AP | 1 | 2 | 3 | 4 |
| 1 | 0 | 1 | 0 | 0 |
| 2 | 1 | 0 | 1 | 0 |
| 3 | 0 | 1 | 0 | 1 |
| 4 | 0 | 0 | 1 | 0 |
The mapping process of task is completed below as step:
1. by data in table 1 divided byIn table 2 data divided byI.e. can get in Fig. 2
Each task node weights of workflow and limit weights.
②The then rank value of task 9The rear-guard of task 6 is only
There is task 9 thenIn like manner According to above-mentioned
Method, obtains rank value such as table 4.
Table 4 each task node rank value
～first 3. selecting task 1 to begin look for, task 1 is put in the middle of PCP, see afterwards the rear-guard of task 1 i.e. [2,3,
4,5], the forerunner of four tasks is task 1, then the task 5 selecting rank value maximum is put in the middle of this section of PCP, sees afterwards
The rear-guard task 8 of task 5, the forerunner of task 8 is [2,4,5], wherein task 2, and 4 are not previously allocated any one section of PCP of entrance, then
This section of PCP has found, and this section of PCP is [1,5], next analyzes this PCP.The unassigned rear-guard [2,3,4] of task 1,
Taking the task of rank maximum in unallocated going out of task, for task 3, its rear-guard is 7, and for task 7, its forerunner is for appointing
Business [3,4], task 4 is not allocated away, then this section of PCP is assigned, and for [3], next analyzes this section of PCP, does not sends out
Existing satisfactory task, terminates.Return to the analysis to task 1, the rear-guard [2,4] that it is unassigned, take rank bigger
Namely task 2, the rear-guard of task 2 is [6,8], neither meets addition PCP, and this section of PCP distribution terminates.According to above-mentioned side
Method is taken off always.The result such as table 5 of its PCP distribution.
Table 5PCP allocation result
| PCP label | 1 | 2 | 3 | 4 | 5 | 6 |
| Comprise task | 1,5 | 3 | 2 | 4,8 | 7 | 6,9,10 |
6.～8. for first paragraph PCP i.e. [1,5], its distribution is to AP1, and for task 1, its EFT is 0, for task 5,
Its forerunner only has task 1, then EFT (i.e. the EFT of the task 5) 1378000/P=137.8 of this section of PCP, and now AP1 is set to not
Can distribute.Next distribution second segment PCP is i.e. [3], and the forerunner of task 3 is task 1, and the EFT of task 1 is 0, can distribute in residue
AP2, in AP3, AP4, their RRT is 0, then the EFT (i.e. the EFT of task 3) distributing to AP1 of PCP is max{0+0/
B, 0}+1383000/P=138.3, in like manner calculate this section of PCP can distribute the EFT of AP3 and AP4 be respectively 138.3 with
138.3, the most in order this section of PCP is mapped to AP2, the EFT obtaining task 3 is 138.3, and now AP2 is set to inseparable
Join.The 3rd section of PCP of distribution is i.e. [2] afterwards, and its forerunner is task 1, and its EFT is 0, and it is remaining assignable AP3, in AP4
RRT be all 0, then PCP distributes to the EFT of AP3 is max{0+0/B, 0}+1339000/P=133.9, in like manner this section of PCP distribution
Also be 133.9 at the EFT (i.e. the EFT of task 2) of AP4, then we sequentially select to be mapped to this section of PCP AP3, the EFT of task 2
Being 133.9, AP3 is set to distribute.Then being allocated the 4th section of PCP i.e. [4,8], the most assignable AP is AP4,
Its RRT is 0, and for task 4, the EFT of its predecessor task 1 is 0, then the EFT=max{0+0/B of task 4,0}+1336000/P=
133.6, for task 8, its forerunner is [2,4,5], these forerunners distribution No. AP be [3,4,1], for task 4, it with
Task 8 is in same PCP, and both transmission delays are disregarded, and for task 2, it is mapped in AP3, and AP3 to AP4 can be direct
Transmission, transmission delay is 8.873456.For task 5, it is positioned at AP1, and AP1 to AP4 cannot directly transmit, it would be desirable to seek
Looking for the routed path of AP1 to AP4, the access path of AP1 is AP2, then with AP1 as starting point, the path of route one jumping is [1,2],
Do not arrive AP3, continually look for.With AP1 as starting point, all routed paths routeing two are [1,2,1], and [1,2,3] does not has yet
Having arrival AP4, with AP1 as starting point, all routed paths of route three jumping are [1,2,1,2], [1,2,3,2], [1,2,3,4],
After wherein, a paths arrives AP4, then selecting this paths is routed path, and now the RRT of AP4 is the EFT of task 4, is
133.6, then the EFT of task 8 is max{max{137.8+7853276/B*3,1383+8873456/B, 133.6}, 133.6}+
1088000/P=270.1598, now AP4 is set to distribute.The most all of AP is both configured to be assigned with, then weigh
Newly all of AP is set to distribute.Continue according to the method, until all of PCP section is assigned, then complete
The task mapping process to AP.
Below it is only the preferred embodiment of the present invention, it should be pointed out that: those skilled in the art are come
Saying, under the premise without departing from the principles of the invention, it is also possible to make some improvements and modifications, these improvements and modifications also should be regarded as
Protection scope of the present invention.
Claims (7)
1. the resource allocation methods of a wireless cloud computing system, it is characterised in that comprise the following steps:
(1) the task n task node weights of calculation workflow and task n take office the weights on m limit；
(2) priority of each task is calculated；
(3) finding task n that residue task medium priority is the highest, PCP is initialized by n；If the rear-guard task of task n has r
Individual, respectively m1, m2 ..., mr；
(4) m1, m2 are removed ..., in mr, forerunner is the most all assigned to the task of any PCP section, takes preferential in remaining task
The task of level value maximum adds this section of PCP, and distribution always is gone down, until not having qualified task, this section of PCP to distribute
Become；
(5) check the task in this section of PCP one by one, complete the distribution of new one section of PCP, until all of task is all assigned to
In PCP section；
(6) if there is no AP can be distributed, then it is set to distribute by all of AP, finds the AP that can distribute PCP section, calculate
The distribution of PCP section extremely can distribute the EFT of AP, compares the EFT that one section of PCP can distribute in AP at each, chooses the value making EFT have minimum
AP as the mapping AP of this section of PCP；
(7) during choosing, choose EFT that AP obtains when being infinite, analyze the task in this section of PCP one by one, if task
Forerunner be infinite to this multiplexed transport time, route；
(8) determine starting point AP and terminal AP, then find out the path being connected two AP by the shortest jumping figure, using this path as road
By path.
The resource allocation methods of a kind of wireless cloud computing system the most according to claim 1, it is characterised in that step (1)
Described in task n task node weights be this node task process time delayWherein I is the task amount of task,
Processing speed for average each AP；It is transmission delay that described task n takes office the weights on m limitIts
Middle Transferdata is the task amount of transmission between task,For the bandwidth of average link between AP.
The resource allocation methods of a kind of wireless cloud computing system the most according to claim 1, it is characterised in that described step
(2) particularly as follows: calculate each task node to the n that ends taskexitThe value of longest path, using this value as each task
Priority.
The resource allocation methods of a kind of wireless cloud computing system the most according to claim 3, it is characterised in that calculate each
Business node is to the n that ends taskexitThe method of longest path particularly as follows: the rear-guard task that sets n task has r, respectively m1,m2,...,
mr, then the priority of task n is
Wherein initialization i.e. ends up task nexitPriorityIexitTask amount for the task that ends up.
The resource allocation methods of a kind of wireless cloud computing system the most according to claim 1, it is characterised in that step (4)
Particularly as follows: assume two set α and β, inside α, put into the task of being assigned to PCP, in β, put into unallocated appointing to PCP
Business, the initial value of α is an empty set, afterwards according to the order of priority rank, finds PCP section；For m1,m2,...,mrIn appoint
Business mi, wherein miAll of predecessor task have q, respectively l1,l2,...,lqIf, l1,l2,...,lqThe most in α,
Then miRetained, and continued distribution, until not having qualified task, this section of PCP to be assigned.
The resource allocation methods of a kind of wireless cloud computing system the most according to claim 1, it is characterised in that step (5)
Particularly as follows: checking one by one in this section of PCP of task, if before there is this task in the rear-guard task of the task in this section of PCP
Drive and all distribute the task to PCP, then start new one section of PCP and be allocated, until all of task is all assigned to PCP section
In.
The resource allocation methods of a kind of wireless cloud computing system the most according to claim 1, it is characterised in that described step
(8) particularly as follows: set and need to carry out the initial AP that route as APfrom, the terminal AP of route is APtoIf jumping through one and increasing jumping figure,
Find out APfromThe AP that can arrive, if in the middle of there is no APto, then continually look for routed path, find out double bounce APfromCan arrive
The AP reached, if the most still not having APto, then continuing to increase jumping figure, AP can be arrived until finding outtoPath till, should
Path is as routed path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610842392.5A CN106302170B (en) | 2016-09-22 | 2016-09-22 | A kind of resource allocation methods of wireless cloud computing system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610842392.5A CN106302170B (en) | 2016-09-22 | 2016-09-22 | A kind of resource allocation methods of wireless cloud computing system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106302170A true CN106302170A (en) | 2017-01-04 |
| CN106302170B CN106302170B (en) | 2019-06-18 |
Family
ID=57712467
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610842392.5A Active CN106302170B (en) | 2016-09-22 | 2016-09-22 | A kind of resource allocation methods of wireless cloud computing system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106302170B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107517079A (en) * | 2017-08-04 | 2017-12-26 | 北京市天元网络技术股份有限公司 | Power communication light path alternate path analysis method and device |
| CN108600328A (en) * | 2018-03-29 | 2018-09-28 | 新华三技术有限公司 | A kind of cluster election method and apparatus |
| CN108647084A (en) * | 2018-05-08 | 2018-10-12 | 武汉轻工大学 | Efficiency cloud method for scheduling task |
| CN109005211A (en) * | 2018-06-29 | 2018-12-14 | 福建师范大学 | Thin cloud deployment and scheduling user task method under a kind of wireless MAN environment |
| CN109639833A (en) * | 2019-01-25 | 2019-04-16 | 福建师范大学 | A kind of method for scheduling task based on wireless MAN thin cloud load balancing |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827378A (en) * | 2010-03-09 | 2010-09-08 | 北京交通大学 | Blending MAC protocol design method suitable for wireless sensor network |
| CN102833864A (en) * | 2012-09-20 | 2012-12-19 | 东南大学 | Radio resource allocation method for multi-cell mobile communication system |
| CN102917077A (en) * | 2012-11-20 | 2013-02-06 | 无锡城市云计算中心有限公司 | Resource allocation method in cloud computing system |
| CN103634330A (en) * | 2012-08-20 | 2014-03-12 | 曙光信息产业(北京)有限公司 | Automatic resource distribution method in cloud calculation environment |
| CN105119997A (en) * | 2015-08-31 | 2015-12-02 | 广州市优普计算机有限公司 | Data processing method of cloud computing system |
-
2016
- 2016-09-22 CN CN201610842392.5A patent/CN106302170B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827378A (en) * | 2010-03-09 | 2010-09-08 | 北京交通大学 | Blending MAC protocol design method suitable for wireless sensor network |
| CN103634330A (en) * | 2012-08-20 | 2014-03-12 | 曙光信息产业(北京)有限公司 | Automatic resource distribution method in cloud calculation environment |
| CN102833864A (en) * | 2012-09-20 | 2012-12-19 | 东南大学 | Radio resource allocation method for multi-cell mobile communication system |
| CN102917077A (en) * | 2012-11-20 | 2013-02-06 | 无锡城市云计算中心有限公司 | Resource allocation method in cloud computing system |
| CN105119997A (en) * | 2015-08-31 | 2015-12-02 | 广州市优普计算机有限公司 | Data processing method of cloud computing system |
Non-Patent Citations (1)
| Title |
|---|
| YUAN ZHANG: ""Computational and communication resource allocation for mobile cooperative cloudlet computing systems"", 《2015 INTERNATIONAL CONFERENCE ON WCSP》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107517079A (en) * | 2017-08-04 | 2017-12-26 | 北京市天元网络技术股份有限公司 | Power communication light path alternate path analysis method and device |
| CN107517079B (en) * | 2017-08-04 | 2019-07-23 | 北京市天元网络技术股份有限公司 | Power communication optical path alternate path analysis method and device |
| CN108600328A (en) * | 2018-03-29 | 2018-09-28 | 新华三技术有限公司 | A kind of cluster election method and apparatus |
| CN108600328B (en) * | 2018-03-29 | 2021-06-29 | 新华三技术有限公司 | Cluster election method and device |
| CN108647084A (en) * | 2018-05-08 | 2018-10-12 | 武汉轻工大学 | Efficiency cloud method for scheduling task |
| CN109005211A (en) * | 2018-06-29 | 2018-12-14 | 福建师范大学 | Thin cloud deployment and scheduling user task method under a kind of wireless MAN environment |
| CN109005211B (en) * | 2018-06-29 | 2021-06-29 | 福建师范大学 | Micro-cloud deployment and user task scheduling method in wireless metropolitan area network environment |
| CN109639833A (en) * | 2019-01-25 | 2019-04-16 | 福建师范大学 | A kind of method for scheduling task based on wireless MAN thin cloud load balancing |
| CN109639833B (en) * | 2019-01-25 | 2021-09-07 | 福建师范大学 | Task scheduling method based on wireless metropolitan area network micro-cloud load balancing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106302170B (en) | 2019-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106302170A (en) | A kind of resource allocation methods of wireless cloud computing system | |
| CN107534583B (en) | Method implemented in a management node and related apparatus | |
| CN108566659B (en) | 5G network slice online mapping method based on reliability | |
| Kim et al. | Multi-agent reinforcement learning-based resource management for end-to-end network slicing | |
| CN103699446A (en) | Quantum-behaved particle swarm optimization (QPSO) algorithm based multi-objective dynamic workflow scheduling method | |
| CN103401939A (en) | Load balancing method adopting mixing scheduling strategy | |
| CN103401947A (en) | Method and device for allocating tasks to multiple servers | |
| CN109947551A (en) | A kind of more round method for allocating tasks, edge calculations system and its storage medium | |
| Munir et al. | Artificial intelligence-based service aggregation for mobile-agent in edge computing | |
| CN110113376A (en) | A kind of Multipath Transmission load balance optimization algorithm based on mobile edge calculations | |
| Zafari et al. | A game-theoretic approach to multi-objective resource sharing and allocation in mobile edge | |
| CN114925852A (en) | Federal learning training method and system based on model segmentation and resource allocation | |
| CN114980039A (en) | Random task scheduling and resource allocation method in MEC system of D2D cooperative computing | |
| Nasser et al. | MOCAB/HEFT algorithm of multi radio wireless communication improved achievement assessment | |
| CN103617083A (en) | Storage scheduling method and system, job scheduling method and system and management node | |
| Stepanov | Model of joint servicing of real-time service traffic and data traffic. II | |
| US10182433B2 (en) | System and method for overlapping rate region zoning | |
| CN106209683B (en) | Data transmission method and system based on data center's wide area network | |
| KR102439426B1 (en) | Multiple federated learning service orchestrator in edge computing and method of performing thereof | |
| CN103632037B (en) | Method for computing server average waiting time based on working vacation | |
| WO2023184009A1 (en) | Systems and methods for cluster-based parallel split learning | |
| Vu et al. | Optimal task offloading and resource allocation for fog computing | |
| Kim et al. | Service caching and computation resource allocation for large-scale edge computing-enabled networks | |
| Al-Kashoash et al. | Optimization-based hybrid congestion alleviation | |
| JP2013541861A (en) | Distributed method for fair bandwidth allocation for content distribution in networks |
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: 20210326 Address after: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New Area, Pudong New Area, Shanghai Patentee after: Shanghai Hanxin Industrial Development Partnership (L.P.) Address before: 210096 No. 2, Four Brand Building, Xinjiekou Street, Xuanwu District, Nanjing City, Jiangsu Province Patentee before: SOUTHEAST University |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230913 Address after: 201615 room 301-6, building 6, no.1158, Jiuting Central Road, Jiuting Town, Songjiang District, Shanghai Patentee after: White box (Shanghai) Microelectronics Technology Co.,Ltd. Address before: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New Area, Pudong New Area, Shanghai Patentee before: Shanghai Hanxin Industrial Development Partnership (L.P.) |
|
| TR01 | Transfer of patent right |