On the importance of nonlinear modeling in computer performance prediction

Computers are nonlinear dynamical systems that exhibit complex and sometimes even chaotic behavior. The models used in the computer systems community, however, are linear. This paper is an exploration of that disconnect: when linear models are adequate for predicting computer performance and when they are not. Specifically, we build linear and nonlinear models of the processor load of an Intel i7-based computer as it executes a range of different programs. We then use those models to predict the processor loads forward in time and compare those forecasts to the true continuations of the time seriesComment: Appeared in "Proceedings of the 12th International Symposium on Intelligent Data Analysis

Dynamic Load Balancing Based on Applications Global States Monitoring

8 pages à paraîtreInternational audienceThe paper presents how to use a special novel distributed program design framework with evolved global control mechanisms to assure processor load balancing during execution of application programs. The new framework supports a programmer with an API and GUI for automated graphical design of program execution control based on global application states monitoring. The framework provides highlevel distributed control primitives at process level and a special control infrastructure for global asynchronous execution control at thread level. Both kinds of control assume observations of current multicore processor performance and communication throughput enabled in the executive distributed system. Methods for designing processor load balancing control based on a system of program and system properties metrics and computational data migration between application executive processes is presented and assessed by experiments with execution of graph representations of distributed programs

A Mobile Computing Architecture for Numerical Simulation

The domain of numerical simulation is a place where the parallelization of numerical code is common. The definition of a numerical context means the configuration of resources such as memory, processor load and communication graph, with an evolving feature: the resources availability. A feature is often missing: the adaptability. It is not predictable and the adaptable aspect is essential. Without calling into question these implementations of these codes, we create an adaptive use of these implementations. Because the execution has to be driven by the availability of main resources, the components of a numeric computation have to react when their context changes. This paper offers a new architecture, a mobile computing architecture, based on mobile agents and JavaSpace. At the end of this paper, we apply our architecture to several case studies and obtain our first results

LOAD DISTRIBUTION AND RESOURCE SHARING

This paper will discuss about the system structure and system design philosophy for the large scale control systems. The design philosophy, the main theme of this article, is "load distribution and resource sharing", but also the following items will be discussed: - three level hierarchy control system philosophy; - coupling and optimal load sharing among SCC/DDC computers; - sharing of the process resources among computers.load distribution

Dynamic optimization of the quality of experience during mobile video watching

Mobile video consumption through streaming is becoming increasingly popular. The video parameters for an optimal quality are often automatically determined based on device and network conditions. Current mobile video services typically decide on these parameters before starting the video streaming and stick to these parameters during video playback. However in a mobile environment, conditions may change significantly during video playback. Therefore, this paper proposes a dynamic optimization of the quality taking into account real-time data regarding network, device, and user movement during video playback. The optimization method is able to change the video quality level during playback if changing conditions require this. Through a user test, the dynamic optimization is compared with a traditional, static, quality optimization method. The results showed that our optimization can improve the perceived playback and video quality, especially under varying network conditions

An Asynchronous Implementation of the Limited Memory CMA-ES

We present our asynchronous implementation of the LM-CMA-ES algorithm, which is a modern evolution strategy for solving complex large-scale continuous optimization problems. Our implementation brings the best results when the number of cores is relatively high and the computational complexity of the fitness function is also high. The experiments with benchmark functions show that it is able to overcome its origin on the Sphere function, reaches certain thresholds faster on the Rosenbrock and Ellipsoid function, and surprisingly performs much better than the original version on the Rastrigin function.Comment: 9 pages, 4 figures, 4 tables; this is a full version of a paper which has been accepted as a poster to IEEE ICMLA conference 201