CN104301932A - Task processing method and device of base station resource pool - Google Patents
Task processing method and device of base station resource pool Download PDFInfo
- Publication number
- CN104301932A CN104301932A CN201410505357.5A CN201410505357A CN104301932A CN 104301932 A CN104301932 A CN 104301932A CN 201410505357 A CN201410505357 A CN 201410505357A CN 104301932 A CN104301932 A CN 104301932A
- Authority
- CN
- China
- Prior art keywords
- calculation task
- time
- running time
- level
- task
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/04—Arrangements for maintaining operational condition
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a task processing method and device of a base station resource pool. The task processing method comprises the steps that the first reference running time and the first actual running time of executed computing tasks and the second reference running time of computing tasks to be executed are determined; the environmental influence specific value is determined through the first reference running time and the first actual running time; the estimated time of the computing tasks to be executed is determined according to the environmental influence specific value and the second reference running time; the estimated time and a preset danger threshold are compared, and when the estimated time is larger than the preset danger threshold, the computing tasks to be executed are discarded; when the estimated time is smaller than or equal to the preset danger threshold, the computing tasks to be executed are disassembled to be in the maximum parallelism degree and be processed. Therefore, real-time performance of services is guaranteed.
Description
Technical field
This application discloses a kind of task processing method and equipment of base station resource pond.
Background technology
In traditional access network framework, base band signal process is usually under the prerequisite meeting real-time demand, application specific processor adopt fixing algorithm arrangement realize, the resource consumed is fixed, and the real-time performance of scheme is also fixed, and does not consider the real time load that Dynamic Matching base station is different.Usually can online under the performance such as resource and running time that scheme uses is estimated.Base station resource pond platform architecture adopts general processor usually, by operating system, Processing tasks is dispatched, so wherein the real-time of physical layer process comparatively traditional platform be difficult to be protected, and in base station resource pond or cloud base station, also do not relate at present the method about physical layer base band signal process Real-time Ability.
Traditional communication equipment often a certain manufacturer provides total solution, system maintenance or upgrading dependence high.And along with energy resources were nervous in recent years, the cost pressure that global mobile communication network operators face is day by day serious.Most of mainstream carrier has the network of multiple different communication standard usually, for ensureing the service quality of network, needs to dispose a large amount of base stations to solve the problem of the network coverage.But the relative scarcity of site and machine room resource, forms with the demand of a large amount of base station deployment the contradiction being difficult to coordinate.And due to the keen competition of Mobile Communications Market, single user average income increasess slowly and even declines, and " profit " ability of operator does not improve thereupon, this will cause the compression of networking and equipment purchase investment.Continue profit and long-run development consideration for industry, Mobile Communication Industry circle proposes to address this problem by changing access network framework.
Novel base station system architecture, as shown in Figure 1, all baseband processing units (Baseband Unit, BBU) and far-end radio frequency units (Radio Remote Unit, RRU) are coupled together by the optical transport network of high bandwidth, low delay.Baseband processing unit concentrates on a physical site and forms baseband pool.High bandwidth, low delay, flexibly topology, low cost interconnection is passed through between multiple baseband processing unit in baseband pool.Base band resource pool needs application base station Intel Virtualization Technology, many base stations shared computation resource in baseband pool, and the distribution of computational resource unifies dynamic dispatching by system according to traffic carrying capacity.And wireless signal Processing Algorithm constitutes wireless communication system physical layer core processing, there is the feature of computation-intensive, and face harsh requirement of real-time.For ensureing real-time, minimizing system energy consumption that base station focuses on, Intel Virtualization Technology is enable to play hardware system performance to greatest extent, to support the communication system base band data process of high-speed cruising, need divide the calculation task of base band signal process and be encapsulated, the calculation task after encapsulation is focused on.Encapsulation scheme can adjust according to the resource service condition in base station resource pond, to adapt to dynamic task allocation on multinuclear general processor and to meet system requirement of real time.
Be different from traditional base station, base station resource pond have accumulated a large amount of computational resources and can hold multiple cell multi-user data and process simultaneously, the requirement of real-time of wireless communication system physical layer signal transacting is higher, for LTE system, close-loop power control and Synchronization Control need to observe logic sequencing and (such as, first measure up channel in upload control and return control command by down channel again; First obtain control command from up channel in descending control and adjust down channel again), HARQ function needs to return at the appointed time and retransmits the instruction two-way time of 4 subframes (such as, in LTE system).And resource pool platform architecture adopts general processor usually, by operating system, Processing tasks is dispatched, therefore in resource pool the real-time of physical layer process comparatively traditional platform be difficult to be protected, base station resource pond physical layer real time monitoring mechanism must be designed to ensure the real-time that communication service is good, but there is not this security mechanism in the prior art to ensure the real-time of business at present.
Summary of the invention
This application provides a kind of task processing method and equipment of base station resource pond, in order to ensure the real-time of business.
This application discloses a kind of task processing method of base station resource pond, comprising:
Determine that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time;
Utilize described first with reference to running time and the first actual run time determination environmental impact ratio;
According to described environmental impact ratio and described second with reference to the estimated time determining described pending calculation task running time;
The described time estimated and the dangerous thresholding preset are contrasted, when the described estimated time is greater than described dangerous thresholding, then abandons described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes.
Concrete, described calculation task comprises: the calculation task of algorithm level, the calculation task of channel level, the calculation task of user class;
When described calculation task is the calculation task of described algorithm level, described calculation task comprises the calculation task of an algorithm level, and running time of the calculation task of an algorithm level described in when statistics only has a calculation task of a described algorithm level is as with reference to running time; Under statistics current environment, the running time of the calculation task of a described algorithm level is as actual run time;
When described calculation task is the calculation task of described channel level, described calculation task comprises the calculation task of a channel level; The calculation task of a described channel level comprises the calculation task of polyalgorithm level, the calculation task of statistics described polyalgorithm level when only there being the calculation task of a described channel level running time summation as with reference to running time; Statistics current environment under described polyalgorithm level calculation task running time summation as actual run time;
When described calculation task is the calculation task of described user class, described calculation task comprises the calculation task of a user class; The calculation task of a described user class comprises the calculation task of multiple channel level, and the calculation task of each channel level in the calculation task of described multiple channel level comprises the calculation task of polyalgorithm level; When statistics only has a calculation task of a described user class described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as with reference to running time using what obtain; Under statistics current environment described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as actual run time using what obtain.
Concrete, described environmental impact ratio is described first actual run time and the ratio of described first reference running time;
The described estimated time is that described environmental impact ratio and described second is with reference to the product of running time.
Preferably, when the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes, comprising:
Be less than or equal to described dangerous thresholding when the described estimated time, and be greater than described bad thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes;
Be less than or equal to described bad thresholding when the described estimated time, then according to predetermined manner, described pending calculation task processed;
Wherein, described bad thresholding is lower than described dangerous thresholding.
Disclosed herein as well is a kind of task treatment facility of base station resource pond, comprising:
Time determination module, determines that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time;
Environmental impact determination module, for utilizing described first with reference to running time and the first actual run time determination environmental impact ratio;
Estimate module, for determining the estimated time of described pending calculation task running time according to described environmental impact ratio and described second reference;
Real-time guarantees module, for being contrasted the described time estimated and the dangerous thresholding preset, when the described estimated time is greater than described dangerous thresholding, then abandons described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes.
Concrete, described calculation task comprises: the calculation task of algorithm level, the calculation task of channel level, the calculation task of user class;
Described time determination module comprises:
The very first time determines submodule, for when described calculation task is the calculation task of described algorithm level, described calculation task comprises the calculation task of an algorithm level, and running time of the calculation task of an algorithm level described in when statistics only has a calculation task of a described algorithm level is as with reference to running time; Under statistics current environment, the running time of the calculation task of a described algorithm level is as actual run time;
Second time determined submodule, and for when described calculation task is the calculation task of described channel level, described calculation task comprises the calculation task of a channel level; The calculation task of a described channel level comprises the calculation task of polyalgorithm level, the calculation task of statistics described polyalgorithm level when only there being the calculation task of a described channel level running time summation as with reference to running time; Statistics current environment under described polyalgorithm level calculation task running time summation as actual run time;
3rd time determined submodule, and for when described calculation task is the calculation task of described user class, described calculation task comprises the calculation task of a user class; The calculation task of a described user class comprises the calculation task of multiple channel level, and the calculation task of each channel level in the calculation task of described multiple channel level comprises the calculation task of polyalgorithm level; When statistics only has a calculation task of a described user class described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as with reference to running time using what obtain; Under statistics current environment described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as actual run time using what obtain.
Preferably, described environmental impact ratio is that described first actual run time and described first is with reference to the ratio of running time;
The described estimated time is that described environmental impact ratio and described second is with reference to the product of running time.
Preferably, described real-time guarantees module when the described estimated time is less than or equal to described dangerous thresholding specifically for:
Be less than or equal to described dangerous thresholding when the described estimated time, and when being greater than described bad thresholding, then described pending calculation task disassembled as maximum parallelism degree processes;
When the described estimated time is less than or equal to described bad thresholding, then according to predetermined manner, described pending calculation task is processed;
Wherein, described bad thresholding is lower than described dangerous thresholding.
Compared with prior art, the application is by determining that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time; Utilize described first with reference to running time and the first actual run time determination environmental impact ratio; According to described environmental impact ratio and described second with reference to the estimated time determining described pending calculation task running time; The described time estimated and the dangerous thresholding preset are contrasted, when the described estimated time is greater than described dangerous thresholding, then abandons described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes, thus ensured the real-time of business.
Accompanying drawing explanation
Fig. 1 is the structural representation in a kind of base station resource pond of the prior art;
Fig. 2 is the schematic flow sheet of the task processing method in a kind of base station resource pond in the embodiment of the present application;
Fig. 3 is the structural representation of the functional class of the calculation task in a kind of base station resource pond in the embodiment of the present application;
Fig. 4 is the method schematic diagram of the division algorithms of different in the embodiment of the present application;
Fig. 5 is the method schematic diagram carrying out the monitoring statistics of multistage multiple spot a kind of running time to calculation task in the embodiment of the present application;
Fig. 6 is the method schematic diagram of a kind of statistical computation Runtime in the embodiment of the present application;
Fig. 7 is the structural representation of the task treatment facility in a kind of base station resource pond in the embodiment of the present application.
Embodiment
The object of the application is to provide a kind of task processing method and equipment of base station resource pond, in order to ensure the real-time of business.
For reaching above technical purpose, as shown in Figure 2, this application provides a kind of task processing method of base station resource pond, specifically comprise the following steps:
Step 101, determine that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time;
Concrete, as shown in Figure 3, described calculation task comprises: the calculation task of algorithm level, the calculation task of channel level, the calculation task of user class;
Wherein, according to functional class, the calculation task of algorithm level is lower than the calculation task of channel level, and the calculation task of channel level is lower than the calculation task of user class, and the calculation task (calculation task that such as channel 1-channel n is corresponding) of the corresponding multiple channel level of the calculation task of a user class (such as the calculation task of user 1 correspondence) meeting, and the calculation task of each channel level (such as the calculation task of channel 1 correspondence) can include the calculation task (calculation task that such as algorithm 1-algorithm n is corresponding) of corresponding polyalgorithm level, also the time that namely calculation task of each channel level runs is the temporal summation that the calculation task of the polyalgorithm level of its subordinate runs, the calculation task of user class is then summation operation time of the calculation task of multiple channel level of subordinate, be in the running time of gathering the calculation task being exactly each upper level running time of the calculation task of same lower functionality level,
As for reference to running time, for the calculation task of algorithm 1 correspondence under channel 1 in the user 1 in Fig. 3, when only there is the calculation task of this algorithm 1 correspondence, the time of the calculation task operation of this algorithm 1 correspondence is the reference running time of the calculation task of algorithm 1 correspondence, but under actual environment, only can not there is this calculation task, also can have other calculation task and (such as also may have the calculation task of channel 2 correspondence, or the calculation task that user n is corresponding) existence, can cause therefore to the running time of calculation task like this, also namely in the environment of current reality, the running time obtained is actual run time.
Therefore, when described calculation task is the calculation task of described algorithm level, described calculation task comprises the calculation task of an algorithm level, and running time of the calculation task of an algorithm level described in when statistics only has a calculation task of a described algorithm level is as with reference to running time; Under statistics current environment, the running time of the calculation task of a described algorithm level is as actual run time;
When described calculation task is the calculation task of described channel level, described calculation task comprises the calculation task of a channel level; The calculation task of a described channel level comprises the calculation task of polyalgorithm level, the calculation task of statistics described polyalgorithm level when only there being the calculation task of a described channel level running time summation as with reference to running time; Statistics current environment under described polyalgorithm level calculation task running time summation as actual run time;
When described calculation task is the calculation task of described user class, described calculation task comprises the calculation task of a user class; The calculation task of a described user class comprises the calculation task of multiple channel level, and the calculation task of each channel level in the calculation task of described multiple channel level comprises the calculation task of polyalgorithm level; When statistics only has a calculation task of a described user class described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as with reference to running time using what obtain; Under statistics current environment described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as actual run time using what obtain.
Certainly, as shown in Figure 4, the time of the calculation task of each algorithm level can be added up, gather again, adopt in this way, can by arranging the mode of an algorithm control point (certainly after each algorithm, also has other mode a lot, as long as the time of corresponding each calculation task can be counted, be not limited to arrange control point) carry out timing statistics, then gather; And in a practical situation, also can calculation task (calculation task as about channel estimating, the channel decoding) group encapsulates centered by, algorithm that requirement of real-time is urgent large by amount of calculation be that a unit is (in such as Fig. 4, the calculation task of the calculation task of algorithm 1 correspondence and algorithm 2 correspondence is encapsulated as one), in the running time (specifically can by arranging real-time control point to carry out) of this unit of statistics.With this, as shown in Figure 5, to the monitoring statistics of carrying out multistage multiple spot running time of calculation task.
As shown in Figure 6, for the schematic diagram of calculation task statistical method operation time under concrete scene, when resource pool runs, along with the execution of calculation task, when algorithm control point completes executed Riming time of algorithm statistics, just the statistics of respective algorithms is reported to channel monitoring point; Then channel monitoring point carries out accumulation renewal to the processing time belonging to same channel reported, and obtains the running time consumed of present channel.This result is reported to user class control point simultaneously.After all calculation tasks of channel complete, the statistics of channel monitoring point can reset after passing to user class control point, and the statistics of user class control point can reset after the Business Processing of this user is complete, the statistics of algorithm control point can reset after reporting channel level control point
;wherein the data processing of user A comprises two channels C1, C2, comprises 3 algorithms L1, L2, L3 and N1, N2, N3 respectively; Channel C1 can arrange 3, algorithm control point: PL1, PL2, PL3, and channel C2 arranges 3, algorithm control point: PN1, PN2, PN3, channel monitoring point 2: PC1, PC2, user monitoring point 1: PA; When L1 executes, PL1 adds up the running time T L1 of L1 and reports to channel monitoring point PC1; And this result also reports to PA; After L2 executes, add up the running time T L2 of L2 at PL2 and report to PC2.Then PC1 carried out cumulative being updated to TL1+TL2 to the time that Channel Processing has consumed; Result after renewal is also passed to PA and is preserved.
Step 102, utilize described first with reference to running time and the first actual run time determination environmental impact ratio;
Concrete, described environmental impact ratio can be the ratio of described first actual run time and described first reference running time; The environment that certainly also can also have other mode to determine is on the impact of calculation task, as long as it can embody the impact of the running time of calculation task just passable.
Step 103, according to described environmental impact ratio and described second with reference to determining estimated time of described pending calculation task running time;
Concrete, based on aforesaid environmental, affect ratio be described first actual run time and the ratio of described first reference running time, and the described estimated time is the product of described environmental impact ratio and described second reference running time; Such as, as shown in Figure 6, if calculation task L2 is just finished, and L2 pre-estimates reference running time be T2, the running time recorded in real time is TL2, and difference between the two can be determined by ratio: γ=TL2/T2; Calculation task L3 does not perform, and in advance reference running time of statistics is T3, and therefore obtainable L3 estimates running time is γ T3; When remaining calculation task only has L3, the estimated time of pending calculation task is γ T3.
Step 104, by the described time estimated with preset dangerous thresholding contrast, when the described estimated time is greater than described dangerous thresholding, then abandon described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes.
Concrete, when the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes, comprise: be less than or equal to described dangerous thresholding when the described estimated time, and be greater than described bad thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes; Be less than or equal to described bad thresholding when the described estimated time, then according to predetermined manner, described pending calculation task processed; Wherein, described bad thresholding is lower than described dangerous thresholding;
Wherein, described dangerous thresholding is arranged based on the processing mode of maximum parallelism degree, estimated time is greater than dangerous thresholding and means that estimating of untreated calculation task cannot ensure that calculation task completes in the requirement of real-time of agreement, even if realize with maximum parallelism degree running time; Bad thresholding then just can complete follow-up pending calculation task based on according to predetermined manner (processing normally) and arrange, dangerous thresholding is less than or equal to when the estimated time, but be greater than bad thresholding, mean untreated calculation task to estimate running time limited, need follow-up work to perform with maximum parallelism degree and ensure requirement of real-time; And if the estimated time is less than bad thresholding or equal bad thresholding, in fact mean and do not need extra operation, can completing according to normal operation, so also with regard to not needing, calculation task being disassembled as maximum parallelism degree processes, effectively system resource can be saved.
The application is by determining that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time; Utilize described first with reference to running time and the first actual run time determination environmental impact ratio; According to described environmental impact ratio and described second with reference to the estimated time determining described pending calculation task running time; The described time estimated and the dangerous thresholding preset are contrasted, when the described estimated time is greater than described dangerous thresholding, then abandons described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes, thus ensured the real-time of business.
The embodiment of the present application two also discloses a kind of task treatment facility of base station resource pond, as shown in Fig. 7 institute, comprising:
Time determination module 701, determines that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time;
Environmental impact determination module 702, for utilizing described first with reference to running time and the first actual run time determination environmental impact ratio;
Estimate module 703, for determining the estimated time of described pending calculation task running time according to described environmental impact ratio and described second reference;
Real-time guarantees module 704, for being contrasted the described time estimated and the dangerous thresholding preset, when the described estimated time is greater than described dangerous thresholding, then abandons described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes.
Concrete, described calculation task comprises: the calculation task of algorithm level, the calculation task of channel level, the calculation task of user class;
Described time determination module 701 comprises:
The very first time determines submodule 7011, for when described calculation task is the calculation task of described algorithm level, described calculation task comprises the calculation task of an algorithm level, and running time of the calculation task of an algorithm level described in when statistics only has a calculation task of a described algorithm level is as with reference to running time; Under statistics current environment, the running time of the calculation task of a described algorithm level is as actual run time;
Second time determined submodule 7012, and for when described calculation task is the calculation task of described channel level, described calculation task comprises the calculation task of a channel level; The calculation task of a described channel level comprises the calculation task of polyalgorithm level, the calculation task of statistics described polyalgorithm level when only there being the calculation task of a described channel level running time summation as with reference to running time; Statistics current environment under described polyalgorithm level calculation task running time summation as actual run time;
3rd time determined submodule 7013, and for when described calculation task is the calculation task of described user class, described calculation task comprises the calculation task of a user class; The calculation task of a described user class comprises the calculation task of multiple channel level, and the calculation task of each channel level in the calculation task of described multiple channel level comprises the calculation task of polyalgorithm level; When statistics only has a calculation task of a described user class described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as with reference to running time using what obtain; Under statistics current environment described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as actual run time using what obtain.
Concrete, described environmental impact ratio is described first actual run time and the ratio of described first reference running time;
The described estimated time is that described environmental impact ratio and described second is with reference to the product of running time.
Concrete, described real-time guarantees module 704 when the described estimated time is less than or equal to described dangerous thresholding specifically for:
Be less than or equal to described dangerous thresholding when the described estimated time, and when being greater than described bad thresholding, then described pending calculation task disassembled as maximum parallelism degree processes;
When the described estimated time is less than or equal to described bad thresholding, then according to predetermined manner, described pending calculation task is processed;
Wherein, described bad thresholding is lower than described dangerous thresholding.
The application is by determining that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time; Utilize described first with reference to running time and the first actual run time determination environmental impact ratio; According to described environmental impact ratio and described second with reference to the estimated time determining described pending calculation task running time; The described time estimated and the dangerous thresholding preset are contrasted, when the described estimated time is greater than described dangerous thresholding, then abandons described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes, thus ensured the real-time of business.
It will be appreciated by those skilled in the art that accompanying drawing is a schematic diagram preferably implementing scene, the module in accompanying drawing or flow process might not be that enforcement the application is necessary.
It will be appreciated by those skilled in the art that the module in the device implemented in scene can carry out being distributed in the device of enforcement scene according to implementing scene description, also can carry out respective change and being arranged in the one or more devices being different from this enforcement scene.The module of above-mentioned enforcement scene can merge into a module, also can split into multiple submodule further.
Above-mentioned the application's sequence number, just to describing, does not represent the quality implementing scene.
Be only the several concrete enforcement scene of the application above, but the application is not limited thereto, the changes that any person skilled in the art can think of all should fall into the protection range of the application.
Claims (8)
1. the task processing method in base station resource pond, is characterized in that, comprising:
Determine that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time;
Utilize described first with reference to running time and the first actual run time determination environmental impact ratio;
According to described environmental impact ratio and described second with reference to the estimated time determining described pending calculation task running time;
The described time estimated and the dangerous thresholding preset are contrasted, when the described estimated time is greater than described dangerous thresholding, then abandons described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes.
2. the method for claim 1, is characterized in that,
Described calculation task comprises: the calculation task of algorithm level, the calculation task of channel level, the calculation task of user class;
When described calculation task is the calculation task of described algorithm level, described calculation task comprises the calculation task of an algorithm level, and running time of the calculation task of an algorithm level described in when statistics only has a calculation task of a described algorithm level is as with reference to running time; Under statistics current environment, the running time of the calculation task of a described algorithm level is as actual run time;
When described calculation task is the calculation task of described channel level, described calculation task comprises the calculation task of a channel level; The calculation task of a described channel level comprises the calculation task of polyalgorithm level, the calculation task of statistics described polyalgorithm level when only there being the calculation task of a described channel level running time summation as with reference to running time; Statistics current environment under described polyalgorithm level calculation task running time summation as actual run time;
When described calculation task is the calculation task of described user class, described calculation task comprises the calculation task of a user class; The calculation task of a described user class comprises the calculation task of multiple channel level, and the calculation task of each channel level in the calculation task of described multiple channel level comprises the calculation task of polyalgorithm level; When statistics only has a calculation task of a described user class described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as with reference to running time using what obtain; Under statistics current environment described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as actual run time using what obtain.
3. the method for claim 1, is characterized in that,
Described environmental impact ratio is that described first actual run time and described first is with reference to the ratio of running time;
The described estimated time is that described environmental impact ratio and described second is with reference to the product of running time.
4. the method for claim 1, is characterized in that, when the described estimated time is less than or equal to described dangerous thresholding, then disassembles described pending calculation task for maximum parallelism degree processes, comprising:
Be less than or equal to described dangerous thresholding when the described estimated time, and be greater than described bad thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes;
Be less than or equal to described bad thresholding when the described estimated time, then according to predetermined manner, described pending calculation task processed;
Wherein, described bad thresholding is lower than described dangerous thresholding.
5. the task treatment facility in base station resource pond, is characterized in that, comprising:
Time determination module, determines that first of the calculation task that executed completes with reference to running time and the first actual run time, and second of pending calculation task with reference to running time;
Environmental impact determination module, for utilizing described first with reference to running time and the first actual run time determination environmental impact ratio;
Estimate module, for determining the estimated time of described pending calculation task running time according to described environmental impact ratio and described second reference;
Real-time guarantees module, for being contrasted the described time estimated and the dangerous thresholding preset, when the described estimated time is greater than described dangerous thresholding, then abandons described pending calculation task; When the described estimated time is less than or equal to described dangerous thresholding, then described pending calculation task is disassembled as maximum parallelism degree processes.
6. equipment as claimed in claim 5, it is characterized in that, described calculation task comprises: the calculation task of algorithm level, the calculation task of channel level, the calculation task of user class;
Described time determination module comprises:
The very first time determines submodule, for when described calculation task is the calculation task of described algorithm level, described calculation task comprises the calculation task of an algorithm level, and running time of the calculation task of an algorithm level described in when statistics only has a calculation task of a described algorithm level is as with reference to running time; Under statistics current environment, the running time of the calculation task of a described algorithm level is as actual run time;
Second time determined submodule, and for when described calculation task is the calculation task of described channel level, described calculation task comprises the calculation task of a channel level; The calculation task of a described channel level comprises the calculation task of polyalgorithm level, the calculation task of statistics described polyalgorithm level when only there being the calculation task of a described channel level running time summation as with reference to running time; Statistics current environment under described polyalgorithm level calculation task running time summation as actual run time;
3rd time determined submodule, and for when described calculation task is the calculation task of described user class, described calculation task comprises the calculation task of a user class; The calculation task of a described user class comprises the calculation task of multiple channel level, and the calculation task of each channel level in the calculation task of described multiple channel level comprises the calculation task of polyalgorithm level; When statistics only has a calculation task of a described user class described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as with reference to running time using what obtain; Under statistics current environment described polyalgorithm level calculation task running time summation as running time of the calculation task of a channel level, and the running time of the calculation task of described multiple channel level is gathered, gather the time as actual run time using what obtain.
7. equipment as claimed in claim 5, is characterized in that,
Described environmental impact ratio is that described first actual run time and described first is with reference to the ratio of running time;
The described estimated time is that described environmental impact ratio and described second is with reference to the product of running time.
8. equipment as claimed in claim 5, is characterized in that, described real-time guarantees module when the described estimated time is less than or equal to described dangerous thresholding specifically for:
Be less than or equal to described dangerous thresholding when the described estimated time, and when being greater than described bad thresholding, then described pending calculation task disassembled as maximum parallelism degree processes;
When the described estimated time is less than or equal to described bad thresholding, then according to predetermined manner, described pending calculation task is processed;
Wherein, described bad thresholding is lower than described dangerous thresholding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410505357.5A CN104301932B (en) | 2014-09-26 | 2014-09-26 | The task processing method and equipment of a kind of base station resource pond |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410505357.5A CN104301932B (en) | 2014-09-26 | 2014-09-26 | The task processing method and equipment of a kind of base station resource pond |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104301932A true CN104301932A (en) | 2015-01-21 |
| CN104301932B CN104301932B (en) | 2017-12-05 |
Family
ID=52321451
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410505357.5A Active CN104301932B (en) | 2014-09-26 | 2014-09-26 | The task processing method and equipment of a kind of base station resource pond |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104301932B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107995692A (en) * | 2017-10-30 | 2018-05-04 | 浙江工业大学 | A kind of cloud access is surfed the net no speed rates mechanism |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120202507A1 (en) * | 2009-10-20 | 2012-08-09 | Zte Corporation | Base band pool device, and method for implementing base band data switch thereof |
| CN103095411A (en) * | 2013-01-11 | 2013-05-08 | 电子科技大学 | Processing method for baseband signals in cloud base station |
| CN103167618A (en) * | 2013-03-14 | 2013-06-19 | 重庆邮电大学 | Centralization management system and method of base band resource pool based on radio access network (RAN) framework |
| CN103297986A (en) * | 2013-06-09 | 2013-09-11 | 北京邮电大学 | Networking method for intelligent adaption wireless communication networks |
| US20140031049A1 (en) * | 2012-07-26 | 2014-01-30 | Nec Laboratories America, Inc. | Cloud-based Radio Access Network for Small Cells |
| CN103841647A (en) * | 2014-03-07 | 2014-06-04 | 北京邮电大学 | Multi-granularity telescopic packaging device and method based on base station resource pool |
-
2014
- 2014-09-26 CN CN201410505357.5A patent/CN104301932B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120202507A1 (en) * | 2009-10-20 | 2012-08-09 | Zte Corporation | Base band pool device, and method for implementing base band data switch thereof |
| US20140031049A1 (en) * | 2012-07-26 | 2014-01-30 | Nec Laboratories America, Inc. | Cloud-based Radio Access Network for Small Cells |
| CN103095411A (en) * | 2013-01-11 | 2013-05-08 | 电子科技大学 | Processing method for baseband signals in cloud base station |
| CN103167618A (en) * | 2013-03-14 | 2013-06-19 | 重庆邮电大学 | Centralization management system and method of base band resource pool based on radio access network (RAN) framework |
| CN103297986A (en) * | 2013-06-09 | 2013-09-11 | 北京邮电大学 | Networking method for intelligent adaption wireless communication networks |
| CN103841647A (en) * | 2014-03-07 | 2014-06-04 | 北京邮电大学 | Multi-granularity telescopic packaging device and method based on base station resource pool |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107995692A (en) * | 2017-10-30 | 2018-05-04 | 浙江工业大学 | A kind of cloud access is surfed the net no speed rates mechanism |
| CN107995692B (en) * | 2017-10-30 | 2021-06-25 | 浙江工业大学 | Uplink no-rate transmission mechanism of cloud access network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104301932B (en) | 2017-12-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103841647B (en) | Multi-granularity telescopic packaging device and method based on base station resource pool | |
| JP2022522057A (en) | Multi-user multi-MEC task unload resource scheduling method based on collaboration between edge and terminal | |
| CN102668613B (en) | Method and apparatus for realizing base band resource pool in lte base station | |
| Mijumbi et al. | Server placement and assignment in virtualized radio access networks | |
| US8509831B2 (en) | Joint user equipment scheduling and cluster formation for distributed antenna systems | |
| IL182824A0 (en) | Method for managing resources in a platform for the telecommunication service and/or network management, corresponding platform and computer program product thereof | |
| CN104038540A (en) | Method and system for automatically selecting application proxy server | |
| CN113156992B (en) | Three-layer architecture collaborative optimization method for unmanned aerial vehicle in edge environment | |
| CN109195178A (en) | signal quality monitoring method and terminal device | |
| CN109614228B (en) | Comprehensive monitoring front-end system based on dynamic load balancing mode and working method | |
| Wang et al. | Power-minimization computing resource allocation in mobile cloud-radio access network | |
| CN107172623A (en) | A kind of TD LTE230 wireless private networks frequency resource planing method | |
| CN102510403B (en) | Receive and the cluster distributed system and method for real-time analysis for vehicle data | |
| CN104852756B (en) | A kind of antenna mapping method, device and digital front-end | |
| CN104123185A (en) | Resource scheduling method, device and system | |
| CN105594158A (en) | Resource configuration method and device | |
| CN104301932A (en) | Task processing method and device of base station resource pool | |
| CN103974321B (en) | The monitoring method and device of a kind of repeater | |
| CN112020075B (en) | Communication guarantee method and device based on traffic prediction and computing equipment | |
| CN105101384B (en) | A kind of method and network node of cell power management | |
| CN105302628B (en) | The moving method and device of a kind of virtual machine in base station resource pond | |
| RU2013125614A (en) | METHOD FOR FORMING A PROTECTED COMMUNICATION SYSTEM INTEGRATED WITH A UNIFIED TELECOMMUNICATION NETWORK IN THE CONDITIONS OF EXTERNAL DESTRUCTIVE INFLUENCE | |
| CN110536327A (en) | The configuration method and device, electronic equipment, storage medium of 5G network carrying ability | |
| CN105517176A (en) | Method for dynamic scheduling of resources of virtualized base station | |
| CN104270777A (en) | Performance statistics assessment method for base station resource pool physical layer algorithm packing scheme |
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 |