CN109491778A - Method for allocating tasks based on NFC-RAN scene - Google Patents
Method for allocating tasks based on NFC-RAN scene Download PDFInfo
- Publication number
- CN109491778A CN109491778A CN201811399408.5A CN201811399408A CN109491778A CN 109491778 A CN109491778 A CN 109491778A CN 201811399408 A CN201811399408 A CN 201811399408A CN 109491778 A CN109491778 A CN 109491778A
- Authority
- CN
- China
- Prior art keywords
- task
- proximal end
- processing
- price
- remote
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Abstract
A kind of method for allocating tasks based on NFC-RAN scene of this paper disclosure of the invention mainly solves the problems, such as that prior art distribution income is low.Its implementation is: the relevant parameter of 1. setting mobile terminals and processing end；2. processing time, the bargain price of task and the processing income of task of calculating task；3. the set resource proximally and distally that calculating task uses；4. in each cell, sequentially task is distributed to the processing center of proximal end according to the use of task proximal end set resource sequence；5. the task of the processing center for no distribution to proximal end, the distal end set resource sequence to using, task is sequentially distributed to remote processing center, complete the remote allocation of task；6. according to the proximal end allocation result and remote allocation of task as a result, calculating total task handles income.The present invention sufficiently uses the ability of processing center to obtain maximum value, improves the income of processing, can be used for the task distribution under the scene of NFC-RAN.
Description
Technical field
The invention belongs to mobile communication field, in particular to a kind of distribution method of task can be used in NFC-RAN scene
Under, the task of mobile terminal is distributed to different processing positions, obtains maximized operator's income.
Background technique
The further development of 5G technology, brings a greater variety of business scenarios, the communication overlay field including traditional wide area
Scape, the scene of emerging high-transmission data rate, the delay sensitive scene of low time delay and the large-scale task of high throughput
Scene.Therefore, the structure of existing 4G network is not able to satisfy the demand of these above-mentioned emerging scenes, and cloud computing is considered
It is the most promising method for solving above-mentioned scene, i.e. mobile terminal uploads to task in cloud, and result is returned after completion processing
Mobile terminal is passed to, mitigates the processing pressure of mobile terminal by the remote processor of task.
Existing cloud computing framework is centralized wireless access planar network architecture C-RAN, can be shifting in the structure of C-RAN
The processing task of dynamic terminal distributes to remote cloud, by the transmission process of task, to mitigate the processing pressure of mobile terminal.However it is right
In some present mobile tasks, such as VR/AR business, Internet of Things, sensibility of these mobile services for time delay, the standard of transmission
True property requirement is higher, and the requirement of some business cannot be met by basic C-RAN framework.Therefore it needs using close remote
The centralized wireless accessing network structure NFC-RAN of field, in the structure of NFC-RAN, including proximally and distally different processing positions
It sets, the task of mobile terminal, can choose different processing positions, by different link transmissions, complete task allocation processing.
Under NFC-RAN structure, for the same task, the difference of position is handled, the profit of operator also can be different, because
This is in a task allocation plan, for mobile operator, turns to target with the maximum of profit, the distribution of completion task is
It is necessary to.
Under the structure of NFC-RAN, existing some method for allocating tasks are to maximize the completion of task and distribute number
For target, the success rate of all mobile terminal task distribution is mainly considered.Such as in Optimal task allocation in
In near-far computing enhanced C-RAN for wireless big data processing text, provide
Method for allocating tasks is, using the completion number for maximizing task as target, to list the number of task distribution under the framework of NFC-RAN
Model is learned, according to the requirement of the different disposal of task and the energy power limit of different disposal position, distributes task to different places
Position is managed, allocation result to the end is obtained, obtains the success rate of task distribution.But this distribution method does not consider completion task
Pricing problem, also do not consider processing profit situation.Therefore task distribution is carried out using this method for allocating tasks, it cannot
Overall profit well is obtained, however, for mobile operator, more concerned about the profit of task processing, existing solution
Model and allocation plan cannot obtain maximized profit well.
Summary of the invention
It is an object of the invention in view of the above shortcomings of the prior art, provide a kind of task based on NFC-RAN scene
Distribution method improves the overall of task allocation result and makes a profit to complete the price for task, to realize mobile operator benefit
The maximization of profit.
To reach above-mentioned target, technical solution of the present invention includes the following:
(1) parameter of mobile terminal is set:
Setting needs to carry out the number of cells M, the mobile terminal number N of j-th of cell of task distributionj, in j-th of cell
I mobile terminal UijMission requirements (Dij, Fij, Tij, Pcu), wherein DijIt is the transmission data of task, FijIt is the processing of task
Revolution, TijIt is the delay requirement of task, PcuIt is the price limit of task, task is in the processing capacity that remote processor obtains
Task handles the processing capacity obtained in proximal end
(2) parameter at setting processing end:
Set remote processor ability FFAnd the processing capacity of the proximal end of each cellThat is distal end and the processing of each proximal end
The upper limit of ability, remote processor ability are usually set to 10 times of proximal end processing capacity or so, set the speed of transmission of radio links
Rate sizeThe rate size of forward pass link transmissionSet the capacity limit R of forward pass linkj；
Set the transmission price P of proximal end linkw, distal end link transmission price PL, proximal end processing price PN, remote processor is fixed
Valence PF, set the transmission cost C of proximal end linkw, distal end link transmission cost CL, remote processor cost CF, proximal end processing cost CN；
(3) the remote processor time FT of each task is calculated according to different processing positionsijWith the processing time of proximal end
NTij:
(4) the remote processor income of each task is calculated according to different processing positionsWith the processing income of proximal end
Wherein FPijFor remote processor price, FCijFor remote processor cost, NPijFor proximal end bargain price, NCijFor proximal end
The cost of processing；
(5) the remote processor set resource A that each task uses is calculated according to the different location of processingijIt handles and collects with proximal end
Joint source Bij；
(6) initialization task allocation plan:
The remote allocation of all tasks of assignment indicates are as follows: aij=0, i.e., all mobile terminal UijTask be not allocated to
Remote processor；
Instruction is distributed in the proximal end of all tasks of assignment are as follows: bij=0, i.e., all mobile terminal UijTask be not allocated to
Proximal end processing；
(7) distribution of the task in proximal end processing center:
In each cell, task by proximal end processing set resource BijAscending sort, by task according to ranking results according to
Secondary trial is added proximal end processing center and it is small that active user is just assigned to this if proximal end processing center meets the requirement of task
The proximal end processing center in area, while assignment bij=1, it is wanted until the processing capacity of current proximal end processing center is not able to satisfy task
It asks, terminates to distribute the task of current proximal end processing center；
(8) distribution of the task in remote processing center:
For all bij=0 task, to remote processor set resource AijAccording to ascending sort, by task according to sequence
As a result addition remote processing center is successively attempted just to distribute active user if remote processing center meets the requirement of task
To remote processing center, while assignment aij=1, until the processing capacity of remote processing center is not able to satisfy mission requirements, terminate
Task distribution for remote processing center；
(9) according to the remote allocation result a of taskijWith the proximal end allocation result b of taskij, obtain task processing income always
S:
Of the invention has the advantage that compared with prior art
First, since the pricing method of proposition of the invention includes the two parts for transmitting price and bargain price, consider remote
Proximal end link transmission price and the processing price at far and near end, while considering the resource of mission requirements, Reasonable has been calculated at task
Bring income is managed, thus in terms of task price and income, so that allocation plan is more perfect.
Second, when due to carry out task distribution of the present invention, it is contemplated that the revenue impact of task is used by calculating task
Gather resource, completes the distribution of task, sufficiently used the limited processing capacity of processing center, effectively increased the total of operator
Processing income.
Detailed description of the invention
In order to accurately illustrate allocation plan of the invention, simple introduction is done below for the attached drawing used:
Fig. 1 is implementation flow chart of the invention；
Fig. 2 is the deployment block diagram of the centralized wireless accessing network structure in the nearly far field in the present invention；
Fig. 3 is the income contrast simulation figure that task distribution is carried out with the present invention and existing allocation plan.
Specific embodiment
The embodiment of the present invention and effect are further described with reference to the accompanying drawing:
With reference to Fig. 1, allocation step of the invention is described as follows:
Step 1, the framework model of the centralized wireless accessing network structure NFC-RAN in a nearly far field is constructed:
As shown in Fig. 2, including one in the framework model of the centralized wireless accessing network structure NFC-RAN in a nearly far field
Remote processing center, N in M proximal end processing center and each celljThe mobile terminal of a task to be handled, j=
1 ..., M, one of remote processing center include distal end cloud FEC and baseband processing unit BBU two parts, a proximal end processing
Center belongs to a cell, including proximal end cloud NEC and Remote Radio Unit RRH two parts；The task of mobile terminal can lead to
It crosses transmission of radio links to handle to proximal end processing center NEC completion, or by Radio Link and forward pass link transmission to distally
Processing center FEC completion processing.
Step 2, the parameter of mobile terminal is set:
Set i-th of mobile terminal U in j-th of cellijMission requirements (Dij, Fij, Tij, Pcu), wherein DijIt is task
Transmission data, FijIt is the processing revolution of task, TijIt is the delay requirement of task, PcuIt is the price limit of task, task is remote
End handles the processing capacity obtainedTask handles the processing capacity obtained in proximal end
Step 3, the parameter at setting processing end.
Set remote processor ability FFAnd the processing capacity of the proximal end of each cellThat is distal end and each proximal end handles energy
The upper limit of power, remote processor ability are typically set at 10 times of proximal end processing capacity or so, set the rate of transmission of radio links
SizeThe rate size of forward pass link transmissionThe rate of forward pass link is typically set at the transmission rate of Radio Link
10 times or so, set the capacity limit R of forward pass linkj；
Set the transmission price P of proximal end linkw, distal end link transmission price PL, proximal end processing price PN, remote processor is fixed
Valence PF, set the transmission cost C of proximal end linkw, distal end link transmission cost CL, remote processor cost CF, proximal end processing cost CN。
Step 4, the remote processor time FT of each task is calculatedij。
4a) the distal end radio link transmission times t1 of calculating task:
4b) the forward pass link transmission times t2 of calculating task:
4c) the remote processor time-consuming t3 of calculating task:
4d) according to 4a) -4c) calculated result, calculate remote processor time FTij:
Step 5, the processing time NT of the proximal end of each task is calculatedij。
5a) the proximal end radio link transmission times t4 of calculating task:
5b) proximal end of calculating task handles time-consuming t5:
5c) according to 5a) -5b) calculated result, calculate proximal end handle time NTij:
Step 6, the remote processor income of each task is calculated
6a) the price of the distal end wireless transmission link of calculating task
6b) the price of the forward pass link of calculating task
6c) the price of the remote processor resource of calculating task
6d) according to 6a) -6c) calculated result, the remote processor price FP of calculating taskij:
6e) the cost of calculating task distal end wireless transmission link
6f) the cost of calculating task forward pass link
6g) the cost of calculating task remote processor resource
6h) according to 6e) -6g) calculated result, the remote processor cost FC of calculating taskij:
6i) according to 6d) and calculated result 6h), the remote processor income of calculating task
Step 7, the remote processor income of each task is calculated
7a) calculate the price of proximal end wireless transmission link
7b) calculate the price of proximal end process resource
7c) according to 7a) -7b) calculated result, the proximal end bargain price NP of calculating taskij:
7d) calculate the cost of proximal end wireless transmission link
7e) calculate the cost of proximal end process resource
7f) according to 7d) -7e) calculated result, calculating task proximal end processing cost NCij:
7g) according to 7c) and calculated result 7f), the proximal end of calculating task handle income
Step 8, the remote processor set resource A that each task uses is calculated according to the different location of processingijThe proximal end and
Reason set resource Bij。
Time-consuming FT 8a) is handled to distal end taskijThe processing of the distal end task after being normalized time-consuming A1 is normalizedij；
Income 8b) is handled to distal end taskThe processing of the distal end task after being normalized income A2 is normalizedij；
8c) the forward pass link circuit resource that multiplexed transport is usedThe use of the multiplexed transport after being normalized is normalized
Forward pass link circuit resource A3ij；
8d) the processing capacity for the remote processing center that task is occupiedThe task after being normalized is normalized
The processing capacity A4 of the remote processing center of occupancyij；
8e) according to 8a) -8d) calculated result, calculate remote processor set resource Aij:
Aij=A1ij+A2ij+A3ij+A4ij；
Time-consuming NT 8f) is handled to proximal end taskijThe processing of the proximal end task after being normalized time-consuming B1 is normalizedij；
8h) to the income of proximal end task processingThe income of the processing of the proximal end task after being normalized is normalized
B2ij；
8i) to the processing capacity of proximal end mission requirementsThe proximal end mission requirements after being normalized are normalized
Processing capacity B3ij；
8g) according to 8f) -8i) calculated result, calculate proximal end processing set resource Bij:
Bij=B1ij+B2ij+B3ij。
Step 9, initialization task allocation plan:
If aij,bijThe proximally and distally distribution instruction for respectively indicating task, is 0-1 variable, works as aij=1 illustrates user
Work as b in remote processorij=1 illustrates that user is handled in proximal end；Work as aij=0 illustrates that user in remote processor, does not work as bij=0 explanation
User is not handled in proximal end；
The remote allocation of all tasks of assignment indicates are as follows: aij=0, i.e., all mobile terminal UijTask be not allocated to
Remote processor；
Instruction is distributed in the proximal end of all tasks of assignment are as follows: bij=0, i.e., all mobile terminal UijTask be not allocated to
Proximal end processing.
Step 10, distribution of the task in proximal end processing center:
10a) in each cell, task is carried out in the distribution of proximal end processing center, sets the specific requirement to be met
It is as follows:
Task processing delay TijRequirement are as follows:
Task bargain price limits PcuRequirement are as follows:
The requirement of proximal end processing capacity are as follows:
10b) in each cell, task by proximal end processing set resource BijAscending sort ties task according to sequence
Fruit successively attempt be added proximal end processing center, judge whether proximal end processing center meets 10a) in mission requirements:
Active user is assigned to the proximal end processing center of the cell, while assignment b if meetingij=1；
If the processing capacity of current proximal end processing center is not able to satisfy mission requirements, terminate in the processing of current proximal end
The task of the heart is distributed.
Step 11, distribution of the task in remote processing center.
The following requirement for needing to meet when distribution of the carry out task to remote processing center 11a) is set:
Task processing delay TijRequirement are as follows:
Task bargain price PcuRequirement are as follows:
The requirement of remote processor ability are as follows:
The requirement of forward pass link capacity are as follows:
11b) for all bij=0 task, by remote processor set resource AijFirst according to ascending sort, then by task
It successively attempts that remote processing center is added according to ranking results, judges whether remote processing center meets above-mentioned mission requirements:
Active user is assigned to remote processing center, while assignment a if meetingij=1,
If the processing capacity of remote processing center is not able to satisfy mission requirements, terminate the task for remote processing center
Distribution.
Step 12, according to the remote allocation result a of taskijWith the proximal end allocation result b of taskij, obtain at total task
Manage income S:
Effect of the invention can be further illustrated by simulation result
1. simulated conditions
Taking total cell number is 5, and the number of users of each cell increases to 50 from 10, it is assumed that only one task dispatching of each user
It is to be allocated, DijRandomly choose 0.5M, 2M, 3.5M, 5M；FijRandomly choose 0.5G, 0.75G, 1.25G, 1.5G；TijRandom selection
15s,20s,25s；Randomly choose 5GHz, 6.5GHz, 8.5GHz, 10GHz；0.5GHz, 0.65GHz are randomly choosed,
0.85GHz,1GHz；FFIt is set as 100GHz；Randomly choose 10GHz to 50GHz；Randomly choose 0.5M to 2M；At random
Select 5M to 20M；RjRandomly choose 0.1G/s to 1G/s；PwIt is set as 10yuan/s；PLIt is set as 9yuan/s；PNIt is set as
9yuan/s；PFIt is set as 10yuan/s；CwIt is set as 8yuan/s；CLIt is set as 8yuan/s；CFIt is set as 8yuan/s；CNSetting
For 8yuan/s；PcuIt is set as 40yuan.
2. emulation content and interpretation of result
Emulation 1, according to the parameter of above-mentioned condition setting emulation, for the task of the mobile terminal of all cells, according to this hair
Bright allocation plan and existing allocation plan are allocated task, have obtained the total revenue of operator's processing, as a result such as Fig. 3.
It can be seen from figure 3 that allocation plan of the invention is substantially better than existing allocation plan, i.e. the present invention can be mentioned effectively
The total revenue of high task distribution.
Claims (7)
1. a kind of method for allocating tasks based on NFC-RAN scene, comprising:
(1) parameter of mobile terminal is set:
Setting needs to carry out the number of cells M, the mobile terminal number N of j-th of cell of task distributionj, i-th of shifting in j-th of cell
Dynamic terminal UijMission requirements (Dij, Fij, Tij, Pcu), wherein DijIt is the transmission data of task, FijIt is the processing revolution of task,
TijIt is the delay requirement of task, PcuIt is the price limit of task, task is in the processing capacity that remote processor obtainsTask
In proximal end, the processing capacity of processing acquisition is
(2) parameter at setting processing end:
Set remote processor ability FFAnd the processing capacity of the proximal end of each cellThat is distal end and each proximal end processing capacity
The upper limit, remote processor ability is usually set to 10 times of proximal end processing capacity or so, and the rate for setting transmission of radio links is big
It is smallThe rate size of forward pass link transmissionSet the capacity limit R of forward pass linkj；
Set the transmission price P of proximal end linkw, distal end link transmission price PL, proximal end processing price PN, remote processor price PF,
Set the transmission cost C of proximal end linkw, distal end link transmission cost CL, remote processor cost CF, proximal end processing cost CN；
(3) the remote processor time FT of each task is calculated according to different processing positionsijWith the processing time NT of proximal endij:
(4) the remote processor income of each task is calculated according to different processing positionsWith the processing income of proximal end
Wherein FPijFor remote processor price, FCijFor remote processor cost, NPijFor proximal end bargain price, NCijFor proximal end processing
Cost；
(5) the remote processor set resource A that each task uses is calculated according to the different location of processingijSet money is handled with proximal end
Source Bij；
(6) initialization task allocation plan:
The remote allocation of all tasks of assignment indicates are as follows: aij=0, i.e., all mobile terminal UijTask be not allocated to far-end
Reason；
Instruction is distributed in the proximal end of all tasks of assignment are as follows: bij=0, i.e., all mobile terminal UijTask be not allocated to proximal end
Reason；
(7) distribution of the task in proximal end processing center:
In each cell, task by proximal end processing set resource BijAscending sort successively tastes task according to ranking results
Examination is added proximal end processing center and active user is just assigned to the cell if proximal end processing center meets the requirement of task
Proximal end processing center, while assignment bij=1, until the processing capacity of current proximal end processing center is not able to satisfy mission requirements, knot
Beam distributes the task of current proximal end processing center；
(8) distribution of the task in remote processing center:
For all bij=0 task, to remote processor set resource AijAccording to ascending sort, by task according to ranking results according to
Remote processing center is added in secondary trial, if remote processing center meets the requirement of task, active user is just assigned to distal end
Processing center, while assignment aij=1, until the processing capacity of remote processing center is not able to satisfy mission requirements, end is for remote
Hold the task distribution of processing center；
(9) according to the remote allocation result a of taskijWith the proximal end allocation result b of taskij, obtain task processing income S always:
2. the method according to claim 1, wherein the remote processor price FP in (4)ij, including wireless transmission
The price of the price of link, the price of forward pass link and remote processor resource calculates as follows:
Wherein,It is the price of wireless transmission link,It is the price of forward pass link,It is remote processor resource
Price.
3. the method according to claim 1, wherein the price NP that proximal end is handled in (4)ij, including wireless transmission
The resource price of the price of link and proximal end processing, calculates as follows:
Wherein,It is the price of wireless transmission link,It is the price of proximal end process resource.
4. the method according to claim 1, wherein remote processor cost FC in (4)ij, including wireless transmission chain
The cost of the cost on road, the cost of forward pass link and remote processor resource calculates as follows:
Wherein,It is the cost of wireless transmission link,It is the cost of forward pass link,It is remote processor resource
Cost.
5. the method according to claim 1, wherein the cost NC that proximal end is handled in (4)ij, including wireless transmission
The cost of link and the cost of proximal end process resource calculate as follows:
Wherein,It is the cost of wireless transmission link,It is the cost of proximal end process resource.
6. the method according to claim 1, wherein in (5) task remote processor set resource Aij, being exactly will
The distal end task processing income after distal end task processing time-consuming, normalization after normalization, the multiplexed transport after normalization use
Forward pass link circuit resource, and the result summed of processing capacity of remote processing center that task after normalization occupies.
7. the method according to claim 1, wherein proximal end processing set resource B in (5)ij, being exactly will normalization
Proximal end task afterwards handles time-consuming, the income of the proximal end task processing after normalization, and the proximal end mission requirements after normalization
The result summed of processing capacity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811399408.5A CN109491778A (en) | 2018-11-22 | 2018-11-22 | Method for allocating tasks based on NFC-RAN scene |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811399408.5A CN109491778A (en) | 2018-11-22 | 2018-11-22 | Method for allocating tasks based on NFC-RAN scene |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109491778A true CN109491778A (en) | 2019-03-19 |
Family
ID=65697466
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811399408.5A Pending CN109491778A (en) | 2018-11-22 | 2018-11-22 | Method for allocating tasks based on NFC-RAN scene |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109491778A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068157A (en) * | 2007-06-07 | 2007-11-07 | 武汉理工大学 | Grid task dispatching method based on time and expense restriction |
| US20080155551A1 (en) * | 2006-12-26 | 2008-06-26 | Kabushiki Kaisha Toshiba | Apparatus and computer program product for managing resource |
| CN102857548A (en) * | 2012-04-25 | 2013-01-02 | 梁宏斌 | Mobile cloud computing resource optimal allocation method |
| CN103002053A (en) * | 2012-12-25 | 2013-03-27 | 深圳先进技术研究院 | Profit maximization scheduling method and system of cloud computing |
| CN103077438A (en) * | 2012-12-27 | 2013-05-01 | 深圳先进技术研究院 | Control method and system for scheduling multiple robots |
| US9135581B1 (en) * | 2011-08-31 | 2015-09-15 | Amazon Technologies, Inc. | Resource constrained task scheduling |
| CN105450707A (en) * | 2014-08-29 | 2016-03-30 | 青岛海尔电子有限公司 | Method and system for distributing cloud media resources |
| US20170372384A1 (en) * | 2016-06-27 | 2017-12-28 | Vmware, Inc. | Methods and systems to dynamically price information technology services |
| CN108234603A (en) * | 2017-12-12 | 2018-06-29 | 华南理工大学 | A kind of edge calculations resource allocation methods and system based on price |
-
2018
- 2018-11-22 CN CN201811399408.5A patent/CN109491778A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080155551A1 (en) * | 2006-12-26 | 2008-06-26 | Kabushiki Kaisha Toshiba | Apparatus and computer program product for managing resource |
| CN101068157A (en) * | 2007-06-07 | 2007-11-07 | 武汉理工大学 | Grid task dispatching method based on time and expense restriction |
| US9135581B1 (en) * | 2011-08-31 | 2015-09-15 | Amazon Technologies, Inc. | Resource constrained task scheduling |
| CN102857548A (en) * | 2012-04-25 | 2013-01-02 | 梁宏斌 | Mobile cloud computing resource optimal allocation method |
| CN103002053A (en) * | 2012-12-25 | 2013-03-27 | 深圳先进技术研究院 | Profit maximization scheduling method and system of cloud computing |
| CN103077438A (en) * | 2012-12-27 | 2013-05-01 | 深圳先进技术研究院 | Control method and system for scheduling multiple robots |
| CN105450707A (en) * | 2014-08-29 | 2016-03-30 | 青岛海尔电子有限公司 | Method and system for distributing cloud media resources |
| US20170372384A1 (en) * | 2016-06-27 | 2017-12-28 | Vmware, Inc. | Methods and systems to dynamically price information technology services |
| CN108234603A (en) * | 2017-12-12 | 2018-06-29 | 华南理工大学 | A kind of edge calculations resource allocation methods and system based on price |
Non-Patent Citations (4)
| Title |
|---|
| LIANMING ZHANG 等: "Optimal Task Allocation in Near-Far Computing Enhanced C-RAN for Wireless Big Data Processing", 《IEEE WIRELESS COMMUNICATIONS》 * |
| S. SELVARANI 等: "Improved cost-based algorithm for task scheduling in cloud computing", 《2010 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH》 * |
| 罗红 等: "网格计算中任务调度研究综述", 《计算机应用研究》 * |
| 邓见光 等: "一种成本驱动的云计算任务调度策略", 《江苏大学学报(自然科学版)》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bae et al. | Sequential bandwidth and power auctions for distributed spectrum sharing | |
| CN104038540B (en) | Method and system for automatically selecting application proxy server | |
| CN111246586B (en) | Method and system for distributing smart grid resources based on genetic algorithm | |
| CN104484233B (en) | A kind of resource allocation methods | |
| CN106155791A (en) | A kind of workflow task dispatching method under distributed environment | |
| CN106341893A (en) | Resource distribution method and apparatus | |
| CN105446817B (en) | A kind of federated resource configuration of reservations algorithm based on robust optimization in mobile cloud computing | |
| CN108601074A (en) | A kind of network resource allocation method and device based on isomery joint caching | |
| CN109947574A (en) | A kind of vehicle big data calculating discharging method based on mist network | |
| CN107979846A (en) | Overlapping Game with Coalitions model and spatially adaptive algorithm under a kind of scene consciousness | |
| CN107909207A (en) | Remote Sensing Ground Station Multiobjective Optimal Operation method and system | |
| CN106341826A (en) | Resource optimized distribution method for wireless power private network based on virtualization technology | |
| CN106453143A (en) | Bandwidth setting method, device and system | |
| CN107197466A (en) | Air-ground coordination communication means and device based on non-orthogonal multiple | |
| CN104852756B (en) | A kind of antenna mapping method, device and digital front-end | |
| CN109819032A (en) | A kind of base station selected cloud robot task distribution method with computation migration of joint consideration | |
| CN108848535A (en) | A kind of mist calculating environmental resource distribution method towards shared model | |
| CN109981340B (en) | Method for optimizing joint resources in fog computing network system | |
| CN109996238A (en) | A kind of C-RAN network plan method and device | |
| CN112688848B (en) | Heterogeneous virtual network mapping method and system | |
| CN111935748B (en) | Virtual network resource allocation method with high reliability and load balance | |
| CN106649743A (en) | Method and system for storing and sharing creative idea classified brain library resources | |
| CN104009904B (en) | The virtual network construction method and system of facing cloud platform big data processing | |
| CN109491778A (en) | Method for allocating tasks based on NFC-RAN scene | |
| CN208094601U (en) | Electricity Investment data processing system |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190319 |
|
| RJ01 | Rejection of invention patent application after publication |