2018
DOI: 10.1016/j.future.2016.05.011
|View full text |Cite
|
Sign up to set email alerts
|

Design and implementation of energy-aware application-specific CPU frequency governors for the heterogeneous distributed computing systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 27 publications
0
6
0
Order By: Relevance
“…An optimized control strategy was developed to meet the workload processing deadlines. Papers [61], [79], and [56] address issues concerned with the structure of optimized energy-aware CPU frequency scaling rules. A class of CPU frequency switching rules, exploiting DVFS, is discussed.…”
Section: Energy-saving Technologiesmentioning
confidence: 99%
“…An optimized control strategy was developed to meet the workload processing deadlines. Papers [61], [79], and [56] address issues concerned with the structure of optimized energy-aware CPU frequency scaling rules. A class of CPU frequency switching rules, exploiting DVFS, is discussed.…”
Section: Energy-saving Technologiesmentioning
confidence: 99%
“…Michał P. Karpowicz et al highlights in the 5th paper the design and implementation of energy-aware application-specific CPU frequency governors for the heterogeneous distributed computing systems [8]. The authors propose a benchmarking methodology to identify models of CPU workload dynamics.…”
Section: This Special Issuementioning
confidence: 99%
“…In such a case it is possible to construct specialized power governors suitable for specialized usage scenarios, e.g. a web server, large scale computations or network traffic filtering [7], [8], [17]. The savings achieved by the algorithm presented in [7] are attained mostly by exploiting identified dynamics of applications running, and thus designing a control law that makes it possible to adequately react to load changes.…”
Section: Local Cpu Power Controlmentioning
confidence: 99%
“…r are power consumption values of the card c and the router r, respectively, M ek is throughput and ξ ek power consumption of link e in the state k, y ek = 1 if the energy state of link e is set to k (0 otherwise), z r = 1 if router r transmits any flow (0 otherwise), x c = 1 if card c transmits any flow (0 otherwise), l cp = 1 if port (one of link endpoints) p is on the card c (0 otherwise), u ed = 1 if path d leads through the link e (0 otherwise), binary constants a ep and b ep are used to define ingress and egress links (e) of port p, g rc is set to 1 if card c belongs to the router r.The complexity of the problem results from the fact that authors have combined the routing task -see flow continuity constraints (6)-(8) and link capacity constraint (9) -with hierarchic layout of the network node (router) -constraints (3)-(5) and the multiple energy state model of a linkconstraint(2). An efficient solution of such a complex task is possible by relying on heuristics, usually built as repetitive solving of simpler (usually relaxed) mathematic programming tasks.…”
mentioning
confidence: 99%