A probabilistic graphical model-based approach for minimizing energy under performance constraints

42Citations
Citations of this article
43Readers
Mendeley users who have this article in their library.

Abstract

In many deployments, computer systems are underutilized-meaning that applications have performance requirements that demand less than full system capacity. Ideally, we would take advantage of this under-utilization by allocating system resources so that the performance requirements are met and energy is minimized. This optimization problem is complicated by the fact that the performance and power consumption of various system configurations are often application-or even input-dependent. Thus, practically, minimizing energy for a performance constraint requires fast, accurate estimations of application-dependent performance and power tradeoffs. This paper investigates machine learning techniques that enable energy savings by learning Pareto-optimal power and performance tradeoffs. Specifically, we propose LEO, a probabilistic graphical model-based learning system that provides accurate online estimates of an application's power and performance as a function of system configuration. We compare LEO to (1) offline learning, (2) online learning, (3) a heuristic approach, and (4) the true optimal solution. We find that LEO produces the most accurate estimates and near optimal energy savings.

Cite

CITATION STYLE

APA

Mishra, N., Zhang, H., Lafferty, J. D., & Hoffmann, H. (2015). A probabilistic graphical model-based approach for minimizing energy under performance constraints. In ACM SIGPLAN Notices (Vol. 50, pp. 267–281). Association for Computing Machinery. https://doi.org/10.1145/2694344.2694373

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free