Chaos in computer performance
From MaRDI portal
Publication:3529636
Abstract: Modern computer microprocessors are composed of hundreds of millions of transistors that interact through intricate protocols. Their performance during program execution may be highly variable and present aperiodic oscillations. In this paper, we apply current nonlinear time series analysis techniques to the performances of modern microprocessors during the execution of prototypical programs. Our results present pieces of evidence strongly supporting that the high variability of the performance dynamics during the execution of several programs display low-dimensional deterministic chaos, with sensitivity to initial conditions comparable to textbook models. Taken together, these results show that the instantaneous performances of modern microprocessors constitute a complex (or at least complicated) system and would benefit from analysis with modern tools of nonlinear and complexity science.
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- A practical method for calculating largest Lyapunov exponents from small data sets
- Computability with low-dimensional dynamical systems
- Determining Lyapunov exponents from a time series
- Estimation of dynamical invariants without embedding by recurrence plots
- Nonlinear Time Series Analysis
- Practical implementation of nonlinear time series methods: The TISEAN package
- State space reconstruction in the presence of noise
- Surrogate time series.
- Turing computability with neural nets
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Variation of Lyapunov exponents on a strange attractor
This page was built for publication: Chaos in computer performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529636)