An Intelligent Framework for Energy-Aware Mobile Computing Subject to Stochastic System Dynamics

abstract: User satisfaction is pivotal to the success of mobile applications. At the same time, it is imperative to maximize the energy efficiency of the mobile device to ensure optimal usage of the limited energy source available to mobile devices while maintaining the necessary levels of user satisfaction. However, this is complicated due to user interactions, numerous shared resources, and network conditions that produce substantial uncertainty to the mobile device's performance and power characteristics. In this dissertation, a new approach is presented to characterize and control mobile devices that accurately models these uncertainties. The proposed modeling framework is a completely data-driven approach to predicting power and performance. The approach makes no assumptions on the distributions of the underlying sources of uncertainty and is capable of predicting power and performance with over 93% accuracy. Using this data-driven prediction framework, a closed-loop solution to the DEM problem is derived to maximize the energy efficiency of the mobile device subject to various thermal, reliability and deadline constraints. The design of the controller imposes minimal operational overhead and is able to tune the performance and power prediction models to changing system conditions. The proposed controller is implemented on a real mobile platform, the Google Pixel smartphone, and demonstrates a 19% improvement in energy efficiency over the standard frequency governor implemented on all Android devices.Dissertation/ThesisDoctoral Dissertation Computer Engineering 201

Review of polynomial chaos-based methods for uncertainty quantification in modern integrated circuits

Advances in manufacturing process technology are key ensembles for the production of integrated circuits in the sub-micrometer region. It is of paramount importance to assess the effects of tolerances in the manufacturing process on the performance of modern integrated circuits. The polynomial chaos expansion has emerged as a suitable alternative to standardMonte Carlo-based methods that are accurate, but computationally cumbersome. This paper provides an overview of the most recent developments and challenges in the application of polynomial chaos-based techniques for uncertainty quantification in integrated circuits, with particular focus on high-dimensional problems

Efficient approximation of high-dimensional exponentials by tensornetworks

In this work a general approach to compute a compressed representation of the exponential $\exp(h)$ of a high-dimensional function $h$ is presented. Such exponential functions play an important role in several problems in Uncertainty Quantification, e.g. the approximation of log-normal random fields or the evaluation of Bayesian posterior measures. Usually, these high-dimensional objects are intractable numerically and can only be accessed pointwise in sampling methods. In contrast, the proposed method constructs a functional representation of the exponential by exploiting its nature as a solution of an ordinary differential equation. The application of a Petrov--Galerkin scheme to this equation provides a tensor train representation of the solution for which we derive an efficient and reliable a posteriori error estimator. Numerical experiments with a log-normal random field and a Bayesian likelihood illustrate the performance of the approach in comparison to other recent low-rank representations for the respective applications. Although the present work considers only a specific differential equation, the presented method can be applied in a more general setting. We show that the composition of a generic holonomic function and a high-dimensional function corresponds to a differential equation that can be used in our method. Moreover, the differential equation can be modified to adapt the norm in the a posteriori error estimates to the problem at hand

Novel methods to quantify aleatory and epistemic uncertainty in high speed networks

2017 Summer.Includes bibliographical references.With the sustained miniaturization of integrated circuits to sub-45 nm regime and the increasing packaging density, random process variations have been found to result in unpredictability in circuit performance. In existing literature, this unpredictability has been modeled by creating polynomial expansions of random variables. But the existing methods prove inefficient because as the number of random variables within a system increase, the time and computational cost increases in a near-polynomial fashion. In order to mitigate this poor scalability of conventional approaches, several techniques are presented, in this dissertation, to sparsify the polynomial expansion. The sparser polynomial expansion is created, by identifying the contribution of each random variable on the total response of the system. This sparsification is performed primarily using two different methods. It translates to immense savings, in the time required, and the memory cost of computing the expansion. One of the two methods presented is applied to aleatory variability problems while the second method is applied to problems involving epistemic uncertainty. The accuracy of the proposed approaches is validated through multiple numerical examples

Computing aspects of problems in non-linear prediction and filtering

Imperial Users onl

Ruelle-Pollicott Resonances of Stochastic Systems in Reduced State Space. Part II: Stochastic Hopf Bifurcation

The spectrum of the generator (Kolmogorov operator) of a diffusion process, referred to as the Ruelle-Pollicott (RP) spectrum, provides a detailed characterization of correlation functions and power spectra of stochastic systems via decomposition formulas in terms of RP resonances. Stochastic analysis techniques relying on the theory of Markov semigroups for the study of the RP spectrum and a rigorous reduction method is presented in Part I. This framework is here applied to study a stochastic Hopf bifurcation in view of characterizing the statistical properties of nonlinear oscillators perturbed by noise, depending on their stability. In light of the H\"ormander theorem, it is first shown that the geometry of the unperturbed limit cycle, in particular its isochrons, is essential to understand the effect of noise and the phenomenon of phase diffusion. In addition, it is shown that the spectrum has a spectral gap, even at the bifurcation point, and that correlations decay exponentially fast. Explicit small-noise expansions of the RP eigenvalues and eigenfunctions are then obtained, away from the bifurcation point, based on the knowledge of the linearized deterministic dynamics and the characteristics of the noise. These formulas allow one to understand how the interaction of the noise with the deterministic dynamics affect the decay of correlations. Numerical results complement the study of the RP spectrum at the bifurcation, revealing useful scaling laws. The analysis of the Markov semigroup for stochastic bifurcations is thus promising in providing a complementary approach to the more geometric random dynamical system approach. This approach is not limited to low-dimensional systems and the reduction method presented in part I is applied to a stochastic model relevant to climate dynamics in part III