CN109597378A - A kind of resource-constrained hybrid task energy consumption cognitive method - Google Patents
A kind of resource-constrained hybrid task energy consumption cognitive method Download PDFInfo
- Publication number
- CN109597378A CN109597378A CN201811301749.4A CN201811301749A CN109597378A CN 109597378 A CN109597378 A CN 109597378A CN 201811301749 A CN201811301749 A CN 201811301749A CN 109597378 A CN109597378 A CN 109597378A
- Authority
- CN
- China
- Prior art keywords
- resource
- task
- time
- deadline
- priority
- 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
- 238000005265 energy consumption Methods 0.000 title claims abstract description 41
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000001149 cognitive effect Effects 0.000 title claims abstract description 11
- 230000000737 periodic effect Effects 0.000 claims abstract description 60
- 238000005516 engineering process Methods 0.000 claims abstract description 17
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000012545 processing Methods 0.000 claims description 3
- 230000004044 response Effects 0.000 abstract description 11
- 238000010606 normalization Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/32—Operator till task planning
- G05B2219/32252—Scheduling production, machining, job shop
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Power Sources (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of resource-constrained hybrid task energy consumption cognitive methods, comprising the following steps: establishes resource-constrained hybrid task Real-Time Scheduling model；The deadline of distribution aperiodic task is set, it is dispatched together with periodic duty, and ensure resource exclusive reference using stack resource protocol；Computing resource is limited energy consumption optimum speed So；The dynamic idle time I that computing system generates；Determine the execution speed S of periodic dutyiAnd aperiodic task is with the execution of maximum processor speed；Processor speed is switched into low power consumpting state using dynamic power management technology.The method of the present invention can not only task return period do sth. in advance complete generate free time and server generate free time, it is ensured that resource can be by exclusive reference；And processor speed can be switched into low power consumpting state using dynamic power management technology and save more energy consumptions；The energy consumption of the method for the present invention is lower by 7.18% than existing hybrid task low-power consumption scheduling method with the product of response time.
Description
Technical field
The present invention relates to real-time system field hybrid task energy consumptions to perceive Real-Time Scheduling, specifically a kind of resource-constrained
Hybrid task energy consumption cognitive method.
Background technique
Digital control system is a kind of typical real-time system.Digital control system includes that the hard real-time period of deadline limitation is appointed
It is engaged in and has the aperiodic task of response time requirement.It has to ensure that hard real-time periodic tasks can be for digital control system
It completes to execute in its deadline, then reduces the response time of aperiodic task as far as possible.Due to the increase of digital control system function,
And with the fast development of CMOS technology, the energy consumption of digital control system is higher and higher, so energy consumption also becomes design digital control system
One important goal.
Shared system resource is often required between the periodic duty of digital control system.Due to resource must exclusive reference, this
It results in that priority inversion problem can occur.Existing hybrid task low-power consumption scheduling method, does not account for resource-sharing problem,
Ensure resource exclusive reference just with simple agreement, and low to the utilization efficiency of system idle time, leads to system
Energy consumption is excessively high, does not adapt to the development need of digital control system.
Summary of the invention
It is an object of the invention to overcome the shortcoming of existing hybrid task low-power consumption scheduling method, a kind of resource is provided
Limited hybrid task energy consumption cognitive method, it is contemplated that resource-sharing problem；Ensure resource exclusive reference using stack resource protocol, counts
Resource-constrained optimum speed is calculated, the static free time for making full use of system to generate；Additionally it is possible to what recovery system generated
The dynamic idle time is effectively reduced system energy consumption using DVS technology and DPM technology.
To achieve the goals above, the technical scheme is that
A kind of resource-constrained hybrid task energy consumption cognitive method, comprising the following steps:
Establish resource-constrained hybrid task Real-Time Scheduling model；
The deadline of distribution aperiodic task is set, it is dispatched together with periodic duty, and utilizes stack resource protocol
Ensure resource exclusive reference；
Computing resource is limited energy consumption optimum speed So；
The dynamic idle time I that computing system generates；
Determine the execution speed S of periodic dutyiAnd aperiodic task is with the execution of maximum processor speed；
Processor speed is switched into low power consumpting state using dynamic power management technology；
It is described to establish resource-constrained hybrid task Real-Time Scheduling model, comprising:
Hybrid task includes periodic duty collection and aperiodic task collection；Periodic duty collection is by n hard real-time periodic tasks groups
At wherein n is positive integer；Hard real-time periodic tasks are by TiIt indicates, wherein i is integer, and value range is 1≤i≤n；Period
M reusable resource R of task sharingl, wherein m and l is positive integer, and the value range of l is 1≤l≤m；Aperiodic
Business is by JkIt indicates, wherein k is greater than 1 positive integer；Periodic duty TiBy triple (pi,ei,ri) indicate, wherein piIt is to appoint in the period
Be engaged in TiPeriod；eiIt is periodic duty TiThe execution time under worst case；riIt is periodic duty TiResource requirement；Aperiodic
Be engaged in JkBy binary group (Ak,Ck) indicate, wherein AkIt is aperiodic task JkRelease time；CkIt is aperiodic task JkBe averaged and hold
The row time；
The deadline of the setting distribution aperiodic task, it is dispatched together with periodic duty, and utilize stack resource
Agreement ensures resource exclusive reference, comprising:
The deadline of aperiodic task is initialized as d0=0, and the deadline of server is also configured as 0；According to
The deadline of Policy Updates aperiodic task below:
As the budget q of servers=0, q is sets=Qs, the deadline of aperiodic task is set as dk+Ts, wherein QsFor
The maximum budget of server, TsFor the period of server, dkFor the deadline of current server；
When server is in idle condition, and aperiodic task reaches, and the budget of server meets qs≥(dk-Ak)·
Us, q is sets=Qs, the deadline of aperiodic task is set as dk+Ts, wherein UsFor server bandwidth, AkIt is aperiodic
Be engaged in JkRelease time；Otherwise, the deadline of aperiodic task is set as dk；
It is described to dispatch aperiodic task together with periodic duty, comprising:
Aperiodic task and periodic duty are all to distribute priority according to deadline；Deadline is closer, priority
It is higher；Deadline is remoter, and priority is lower；Deadline is identical, and release time is more early, and priority is higher；When release
Between it is more late, priority is lower；When deadline and all identical priority, the small priority of task subscript is higher；High priority
Task be preferentially scheduled；
The stack resource protocol ensures resource exclusive reference, comprising:
Without access resource during task execution, priority is remained unchanged；When accessing resource, priority becomes
At the highest priority for using the resource tasks；After task discharges resource, priority is restored to original priority；
The dynamic idle time I that the computing system generates, is expressed from the next:
I=Ih+Ic
Wherein, IcFor free time caused by server；IhFree time caused by being completed ahead of time for periodic duty,
IhBy
Following formula indicates:
Wherein, MiIt is task TiRemaining execute time, P (Ti, t) and it is to have completed execution and priority ratio times in moment t
Be engaged in TiThe high set of tasks of priority；
Described that processor speed is switched to low power consumpting state using dynamic power management technology, processing step is as follows:
When processor is in idle condition, and the time that dynamic idle time I is greater than handoff processor state at this time opens
When pin, low power consumpting state is switched the processor into using dynamic power management technology；Otherwise, processor keeps idle state.
Preferably, the resource-constrained energy consumption optimum speed SOCalculation method it is as follows:
So=max { Scrit,ST}
Wherein, ScritFor the speed of service that processor energy consumption is optimal；STFor the optimal velocity in resource-constrained situation, ST's
Value indicates are as follows:
Wherein, DminBe it is resource-constrained under processor demand.
Preferably, the execution speed S of the periodic dutyiCalculation method it is as follows:
Wherein, WiFor task TiWorst case under remaining execute the time.
By the above-mentioned description of this invention it is found that compared with prior art, the invention has the following beneficial effects:
(1) the method for the present invention combines two kinds of Low-power Technologies of DVS and DPM, can efficiently recycle free time,
And its system energy consumption is lower by 7.18% than existing hybrid task low-power consumption scheduling method with the product of response time.
(2) reduction of system energy consumption and aperiodic task response time product helps to improve the reliability of system, improves
The performance of system reduces the probability of system fault.
(3) reduction of system energy consumption and aperiodic task response time product, can reduce the production cost of product, help
In the competitiveness for improving enterprise.
Invention is further described in detail with reference to the accompanying drawings and embodiments, but one kind of the invention is resource-constrained mixed
Conjunction task energy consumption cognitive method is not limited to the embodiment.
Detailed description of the invention
Fig. 1 is the method for the present invention processing step flow chart；
Fig. 2 is the simulation experiment result for normalizing energy consumption and aperiodic task response time product and aperiodic task load
Figure.
Specific embodiment
Below with reference to attached drawing of the present invention, technical solution in the embodiment of the present invention is described in detail and discusses.It answers
Work as understanding, described herein specific examples are only used to explain the present invention, is not intended to limit the present invention.
Shown in Figure 1, a kind of resource-constrained hybrid task energy consumption cognitive method of the present invention includes the following steps:
Step 101: establishing resource-constrained hybrid task Real-Time Scheduling model.
Specifically, hybrid task includes periodic duty collection and aperiodic task collection；Periodic duty collection is by n hard real-time periods
Task composition, wherein n is positive integer；Hard real-time periodic tasks are by TiIndicate, wherein i is integer, value range be 1≤i≤
n；Periodic duty shares m reusable resource Rl, wherein m and l is positive integer, and the value range of l is 1≤l≤m；It is non-
Periodic duty is by JkIt indicates, wherein k is greater than 1 positive integer；Periodic duty TiBy triple (pi,ei,ri) indicate, wherein piIt is
Periodic duty TiPeriod；eiIt is periodic duty TiThe execution time under worst case；riIt is periodic duty TiResource requirement；When
ri=0；Periodic duty TiThere is no resource requirement, that is to say, that it does not need access resource in the process of implementation, and does not have priority
Inversion problem；Work as ri≠0；Periodic duty TiIt needs to access resource in the process of implementation, when the resource is occupied by other tasks,
Periodic duty TiIt is blocked, until the resource is released；Aperiodic task JkBy binary group (Ak,Ck) indicate, wherein AkIt is non-week
Phase task JkRelease time；CkIt is aperiodic task JkAverage performance times.
Step 102: the deadline of setting distribution aperiodic task dispatches it, and utilize stack together with periodic duty
Resource protocol ensures resource exclusive reference.
Specifically, the deadline of aperiodic task is initialized as d0=0, and the deadline of server is also configured as
0；According to the deadline of Policy Updates aperiodic task below:
As the budget q of servers=0, q is sets=Qs, the deadline of aperiodic task is set as dk+Ts, wherein QsFor
The maximum budget of server, TsFor the period of server, dkFor the deadline of current server；
When server is in idle condition, and aperiodic task reaches, and the budget of server meets qs≥(dk-Ak)·
Us, q is sets=Qs, the deadline of aperiodic task is set as dk+Ts, wherein dkFor the deadline of current server, UsFor
Server bandwidth, value areQsFor the maximum budget of server, TsFor the period of server, AkIt is aperiodic task JkRelease
Put the time；Otherwise, the deadline of aperiodic task is set as dk；
It is described to dispatch aperiodic task together with periodic duty, comprising:
Aperiodic task and periodic duty are all to distribute priority according to deadline；Deadline is closer, priority
It is higher；Deadline is remoter, and priority is lower；Deadline is identical, and release time is more early, and priority is higher；When release
Between it is more late, priority is lower；When deadline and all identical priority, the small priority of task subscript is higher；High priority
Task be preferentially scheduled；
The stack resource protocol ensures resource exclusive reference, comprising:
Without access resource during task execution, priority is remained unchanged；When accessing resource, priority becomes
At the highest priority for using the resource tasks；After task discharges resource, priority is restored to original priority；
Step 103: computing resource is limited energy consumption optimum speed So。
The resource-constrained energy consumption optimum speed SOIt is calculated by following formula:
So=max { Scrit,ST}
Wherein, ScritFor the speed of service that processor energy consumption is optimal, STFor the optimal velocity in resource-constrained situation, value
It indicates are as follows:
Wherein, UsFor server bandwidth, value isQsFor the maximum budget of server, TsFor the period of server；
DminBe it is resource-constrained under processor demand.
Periodic duty is first subjected to non-descending arrangement, that is, T according to its period1≤T2≤…≤Tn, then calculated by following formula
Dmin:
Wherein, piIt is periodic duty TiPeriod；eiIt is periodic duty TiThe execution time under worst case；BkIt is task Tk
The maximum obstruction time, k, i are positive integers.
Step 104: the dynamic idle time I that computing system generates；
The dynamic idle time I that system generates, is calculated by following formula:
I=Ih+Ic
Wherein, IcFor free time caused by server, IhFree time caused by being completed ahead of time for periodic duty.
IhIt is calculated by following formula:
Wherein, MiIt is task TiRemaining execute time, P (Ti, t) and it is to have completed execution and priority ratio times in moment t
Be engaged in TiThe high set of tasks of priority.
When server is in idle condition, that is, server does not dispatch aperiodic task；Or server scheduling
When the load of aperiodic task but aperiodic task is lower than the utilization rate of server, at this moment server can generate free time.?
Two adjacent dispatching points, that is, section [ti-1,ti], wherein ti-1And tiIt respectively indicates a upper dispatching point for task and works as
Preceding dispatching point.When server is in idle condition, the free time I of at this moment server generationc=Us·(ti-ti-1),
Middle UsFor the bandwidth of server, value isQsFor the maximum budget of server, TsFor the period of server；Otherwise, server
The free time I of generationc=Us·(ti-ti-1)-Cap, wherein CapIt is aperiodic task in section [ti-1,ti] executed when
Between piece summation.
Step 105: determining the execution speed S of periodic dutyiAnd aperiodic task is with the execution of maximum processor speed.
The execution speed S of periodic dutyiCalculation formula it is as follows:
Wherein, WiFor periodic duty TiWorst case under it is remaining execute the time, when I is the dynamic idle that system generates
Between, MiIt is periodic duty TiRemaining execute time, ScritFor the speed of service that processor energy consumption is optimal, SoFor resource-constrained energy
Optimum speed is consumed, aperiodic task is always with the execution of maximum processor speed；
Step 106: processor speed being switched into low power consumpting state using dynamic power management technology；
When processor is in idle condition, and the time that dynamic idle time I is greater than handoff processor state at this time opens
When pin, low power consumpting state is switched the processor into using dynamic power management technology；Otherwise, processor keeps idle state.
Shown in Figure 2, setting periodic duty collection utilization rate is 0.4, and server bandwidth 0.4 investigates aperiodic task
Load to normalization energy consumption and aperiodic task response time product influence.Compare three kinds of methods in Fig. 2, first,
The BL method of power-saving technology is not used；Second, SMTS method, this method ensure resource exclusive reference using stack resource protocol,
Periodic duty is always with the execution of resource-constrained energy consumption optimum speed, and aperiodic task is always with the operation of maximum processor speed；
Third, method of the invention, this method ensure resource exclusive reference, the dynamic idle that recovery system generates using stack resource protocol
Time, DVS, which is utilized, reduces the execution speed of periodic duty, and aperiodic task is run always with maximum processor speed,
And when processor is in idle condition, the energy consumption of system is further decreased using DPM technology.Figure it is seen that with
The normalization energy consumption and aperiodic task response time product of the increase of aperiodic task load, SMTS method and the method for the present invention
It reduces.This is because SMTS method and the increased speed of the method for the present invention energy consumption are lower than BL method.Regardless of aperiodic task loads
How to change, the normalization energy consumption and aperiodic task response time product of the method for the present invention are consistently lower than other methods.This is
Because DVS technical energy saving is not only utilized in the method for the present invention, but also also uses DPM technology to reduce energy consumption.It can by calculating
Know, the energy consumption low with the product of response time ratio SMTS method 7.18% of the method for the present invention.
The above is only a preferable embodiments in present example.But the present invention is not limited to above-mentioned embodiment party
Case, it is all by the present invention any equivalent change and modification done, generated function without departing from this programme range when,
It belongs to the scope of protection of the present invention.
Claims (3)
1. a kind of resource-constrained hybrid task energy consumption cognitive method, which comprises the following steps:
Establish resource-constrained hybrid task Real-Time Scheduling model；
The deadline of distribution aperiodic task is set, it is dispatched together with periodic duty, and is ensured using stack resource protocol
Resource exclusive reference；
Computing resource is limited energy consumption optimum speed So；
The dynamic idle time I that computing system generates；
Determine the execution speed S of periodic dutyiAnd aperiodic task is with the execution of maximum processor speed；
Processor speed is switched into low power consumpting state using dynamic power management technology；
It is described to establish resource-constrained hybrid task Real-Time Scheduling model, comprising:
Hybrid task includes periodic duty collection and aperiodic task collection；Periodic duty collection is made of n hard real-time periodic tasks,
Middle n is positive integer；Hard real-time periodic tasks are by TiIt indicates, wherein i is integer, and value range is 1≤i≤n；Periodic duty is total
Enjoy m reusable resource Rl, wherein m and l is positive integer, and the value range of l is 1≤l≤m；Aperiodic task is by JkTable
Show, wherein k is greater than 1 positive integer；Periodic duty TiBy triple (pi,ei,ri) indicate, wherein piIt is periodic duty TiWeek
Phase；eiIt is periodic duty TiThe execution time under worst case；riIt is periodic duty TiResource requirement；Aperiodic task JkBy two
Tuple (Ak,Ck) indicate, wherein AkIt is aperiodic task JkRelease time；CkIt is aperiodic task JkAverage performance times；
The deadline of the setting distribution aperiodic task, it is dispatched together with periodic duty, and utilize stack resource protocol
Ensure resource exclusive reference, comprising:
The deadline of aperiodic task is initialized as d0=0, and the deadline of server is also configured as 0；According to below
The deadline of Policy Updates aperiodic task:
As the budget q of servers=0, q is sets=Qs, the deadline of aperiodic task is set as dk+Ts, wherein QsFor service
The maximum budget of device, TsFor the period of server, dkFor the deadline of current server；
When server is in idle condition, and aperiodic task reaches, and the budget of server meets qs≥(dk-Ak)·UsIf
Set qs=Qs, the deadline of aperiodic task is set as dk+Ts, wherein UsFor server bandwidth, AkIt is aperiodic task Jk's
Release time；Otherwise, the deadline of aperiodic task is set as dk；
It is described to dispatch aperiodic task together with periodic duty, comprising:
Aperiodic task and periodic duty are all to distribute priority according to deadline；Deadline is closer, and priority is higher；
Deadline is remoter, and priority is lower；Deadline is identical, and release time is more early, and priority is higher；Release time gets over
Evening, priority are lower；When deadline and all identical priority, the small priority of task subscript is higher；High priority is appointed
Business is preferential scheduled；
The stack resource protocol ensures resource exclusive reference, comprising:
Without access resource during task execution, priority is remained unchanged；When accessing resource, priority becomes to make
With the highest priority of the resource tasks；After task discharges resource, priority is restored to original priority；
The dynamic idle time I that the computing system generates, is expressed from the next:
I=Ih+Ic
Wherein, IcFor free time caused by server；IhFree time caused by being completed ahead of time for periodic duty,
IhIt is expressed from the next:
Wherein, MiIt is task TiRemaining execute time, P (Ti, t) and it is to have completed execution and priority ratio task T in moment ti
The high set of tasks of priority；
Described that processor speed is switched to low power consumpting state using dynamic power management technology, processing step is as follows:
When processor is in idle condition, and at this time dynamic idle time I be greater than handoff processor state time overhead when,
Low power consumpting state is switched the processor into using dynamic power management technology；Otherwise, processor keeps idle state.
2. resource-constrained hybrid task energy consumption cognitive method according to claim 1, which is characterized in that described resource-constrained
Energy consumption optimum speed SOCalculation method it is as follows:
So=max { Scrit,ST}
Wherein, ScritFor the speed of service that processor energy consumption is optimal；STFor the optimal velocity in resource-constrained situation, STValue table
It is shown as:
Wherein, DminBe it is resource-constrained under processor demand.
3. resource-constrained hybrid task energy consumption cognitive method according to claim 2, which is characterized in that the periodic duty
Execution speed SiCalculation method it is as follows:
Wherein, WiFor task TiWorst case under remaining execute the time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811301749.4A CN109597378B (en) | 2018-11-02 | 2018-11-02 | Resource-limited hybrid task energy consumption sensing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811301749.4A CN109597378B (en) | 2018-11-02 | 2018-11-02 | Resource-limited hybrid task energy consumption sensing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109597378A true CN109597378A (en) | 2019-04-09 |
| CN109597378B CN109597378B (en) | 2021-03-09 |
Family
ID=65957484
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811301749.4A Active CN109597378B (en) | 2018-11-02 | 2018-11-02 | Resource-limited hybrid task energy consumption sensing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109597378B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110070219A (en) * | 2019-04-15 | 2019-07-30 | 华侨大学 | One kind mixing critical system static state energy consumption optimization method based on deadline |
| CN111078401A (en) * | 2019-12-02 | 2020-04-28 | 华侨大学 | Periodic task temperature sensing energy consumption optimization method |
| CN111324197A (en) * | 2020-02-07 | 2020-06-23 | 华侨大学 | Method for reducing system energy consumption based on three-speed periodic task |
| CN113759833A (en) * | 2020-06-05 | 2021-12-07 | 航天科工惯性技术有限公司 | Multi-sensor collection task scheduling method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080184243A1 (en) * | 2007-01-31 | 2008-07-31 | Norimasa Otsuki | Data processing system and operating system |
| CN105630126A (en) * | 2014-11-05 | 2016-06-01 | 中国科学院沈阳计算技术研究所有限公司 | Low-power scheduling method for mixed task based on constant bandwidth server |
| CN105893148A (en) * | 2016-03-30 | 2016-08-24 | 华侨大学 | Low-energy-consumption aporadic task scheduling method based on RM strategy |
| CN106970835A (en) * | 2017-03-20 | 2017-07-21 | 华侨大学 | Fixed priority resource limited system level energy consumption optimization method |
| US20180095792A1 (en) * | 2016-10-05 | 2018-04-05 | Mediatek Inc. | Multi-core system including heterogeneous processor cores with different instruction set architectures |
-
2018
- 2018-11-02 CN CN201811301749.4A patent/CN109597378B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080184243A1 (en) * | 2007-01-31 | 2008-07-31 | Norimasa Otsuki | Data processing system and operating system |
| CN105630126A (en) * | 2014-11-05 | 2016-06-01 | 中国科学院沈阳计算技术研究所有限公司 | Low-power scheduling method for mixed task based on constant bandwidth server |
| CN105893148A (en) * | 2016-03-30 | 2016-08-24 | 华侨大学 | Low-energy-consumption aporadic task scheduling method based on RM strategy |
| US20180095792A1 (en) * | 2016-10-05 | 2018-04-05 | Mediatek Inc. | Multi-core system including heterogeneous processor cores with different instruction set architectures |
| CN106970835A (en) * | 2017-03-20 | 2017-07-21 | 华侨大学 | Fixed priority resource limited system level energy consumption optimization method |
Non-Patent Citations (5)
| Title |
|---|
| DONGKUN SHIN AND JIHONG KIM: "Dynamic Voltage Scaling of Mixed Task Sets in Priority-Driven Systems", 《IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS》 * |
| 张忆文: "可靠性感知周期任务能耗管理调度算法", 《计算机科学与探索》 * |
| 张忆文: "常带宽服务器混合任务低功耗调度算法", 《计算机研究与发展》 * |
| 张忆文: "资源受限周期任务低能耗调度算法", 《小型微型计算机系统》 * |
| 张忆文: "资源受限周期任务双速度调度算法", 《小型微型计算机系统》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110070219A (en) * | 2019-04-15 | 2019-07-30 | 华侨大学 | One kind mixing critical system static state energy consumption optimization method based on deadline |
| CN111078401A (en) * | 2019-12-02 | 2020-04-28 | 华侨大学 | Periodic task temperature sensing energy consumption optimization method |
| CN111078401B (en) * | 2019-12-02 | 2023-03-10 | 华侨大学 | Periodic task temperature sensing energy consumption optimization method |
| CN111324197A (en) * | 2020-02-07 | 2020-06-23 | 华侨大学 | Method for reducing system energy consumption based on three-speed periodic task |
| CN111324197B (en) * | 2020-02-07 | 2023-03-07 | 华侨大学 | Method for reducing system energy consumption based on three-speed periodic task |
| CN113759833A (en) * | 2020-06-05 | 2021-12-07 | 航天科工惯性技术有限公司 | Multi-sensor collection task scheduling method |
| CN113759833B (en) * | 2020-06-05 | 2023-06-06 | 航天科工惯性技术有限公司 | Multi-sensor acquisition task scheduling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109597378B (en) | 2021-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109597378A (en) | A kind of resource-constrained hybrid task energy consumption cognitive method | |
| US10541939B2 (en) | Systems and methods for provision of a guaranteed batch | |
| CN105893148B (en) | A kind of accidental task low energy consumption dispatching method based on RM strategy | |
| Mei et al. | Energy-aware preemptive scheduling algorithm for sporadic tasks on DVS platform | |
| US8112644B2 (en) | Dynamic voltage scaling scheduling mechanism for sporadic, hard real-time tasks with resource sharing | |
| EP4383074A1 (en) | Service processing method and apparatus, server, storage medium, and computer program product | |
| US20100153763A1 (en) | Method and apparatus to modulate multi-core usage for energy efficient platform operations | |
| CN106970835B (en) | Hierarchical energy consumption optimization method for fixed priority resource-limited system | |
| Zidenberg et al. | Multiamdahl: How should i divide my heterogenous chip? | |
| CN108984292A (en) | Mix critical system fixed priority periodic duty energy consumption optimization method | |
| CN106445070B (en) | Energy consumption optimization scheduling method for hard real-time system resource-limited sporadic tasks | |
| US20180329750A1 (en) | Resource management method and system, and computer storage medium | |
| CN105975049A (en) | Task synchronization-based low-power dispatching method for sporadic tasks | |
| CN103744735B (en) | The dispatching method and device of a kind of multi-core resource | |
| CN106095581B (en) | Network storage virtualization scheduling method under private cloud condition | |
| CN107132903B (en) | Energy-saving management implementation method, device and network equipment | |
| CN105630126B (en) | One kind is based on normal bandwidth server hybrid task low-power consumption scheduling method | |
| CN109918181B (en) | Worst response time-based task schedulability analysis method for hybrid critical system | |
| WO2017114180A1 (en) | Component logical threads quantity adjustment method and device | |
| CN110850957B (en) | Scheduling method for reducing system power consumption through dormancy in edge computing scene | |
| CN108874517B (en) | Method for optimizing utilization rate division energy consumption of standby system with fixed priority | |
| CN113822485B (en) | Power distribution network scheduling task optimization method and system | |
| CN105117281A (en) | Task scheduling method based on task application signal and execution cost value of processor core | |
| Lee et al. | Multi-speed DVS algorithms for periodic tasks with non-preemptible sections | |
| CN106657226B (en) | Communication system resource cooperative management method based on performance guide |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |