Mémoire (informatique) | EPFL Graph Search

En informatique, la mémoire est un dispositif électronique numérique qui sert à stocker des données. La mémoire est un composant essentiel, présent dans tous les ordinateurs, les consoles de jeux, les GPS et de nombreux appareils électroniques. Les mémoires sont vendues sous forme de pièces détachées de matériel informatique, ou de composants électroniques. Les différences entre les pièces sont la forme, l'usage qui en est fait, la technologie utilisée, la capacité de stockage et le rapport entre le coût et la capacité. La technologie la plus courante utilise des semi-conducteurs . On distingue mémoire vive, mémoire morte et mémoire de masse. Les capacités de mémoire et la miniaturisation de ses supports ont depuis quelques décennies grandi au rythme de la loi de Moore, laquelle pourrait, éventuellement, être bientôt dépassée, grâce à l'utilisation de skyrmions et d'antiskyrmions pour stabiliser les nanosystèmes spintroniques, au profit du pouvoir de traitement des ordinateurs. t

Optimal Control Strategies of Seasonal Storage Devices for District Energy Management

Julien Jocelyn Leprince

The potential energy savings resulting from the cooperative management of community districts, also known as energy hubs, has been widely demonstrated throughout the literature. Various developed predictive control strategies have proven to generate remarkable gains by exploiting the shared energy generation, conversion and storage devices of building communities. However, one difficulty amongst these methods lie in the integration of information regarding the long term perturbations brought to the system. While most of the existing work considers prediction horizons ranging from day ahead to weekly time frames, recent studies have explored the control of inter-seasonal storage units on a yearly basis through available historical data sets. This study focuses on testing and improving the existing methods while integrating combined and stand alone wind generation to the system. In particular, the contribution of the seasonal storage state bounds for Value function approximation and control process has been investigated for several well-known methods, including scenario approach, stochastic dual dynamic programing and adaptive dynamic programing. Solving the resulting multistage stochastic optimization problem reveals very good results and demonstrate the contributions of the bounds to almost all Value function approximation methods. In fine, the integration of wind production to the system underlines the importance of seasonal trends for efficient optimization of long term storage and suggests using tolerance margins around the bounds for systems particularly sensitive to perturbations.

2018

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

Jasmina Malicevic

Graph processing systems are used in a wide variety of fields, ranging from biology to social networks. Algorithms to mine graphs incur many random accesses, and the sparse nature of the graphs of interest, exacerbates this. As DRAM sustains high bandwidth in the presence of random accesses, traditionally, it was the chosen medium to store and process graphs from. Many in-memory systems were presented at top tier conferences, and every system compared to the previous in algorithm execution time. What is not clearly evaluated are the overheads of pre-processing the input in order to support particular optimisations. More critical, for a systems designer, it is very hard to reason about what are the fundamental techniques that lead to performance gains. We implement the proposed optimisations of state-of-the-art systems within one system to answer this question. We found that the pre-processing cost often dominates the cost of algorithm execution, calling into question the benefits of proposed algorithmic optimisations that rely on extensive pre-processing. The design of a system has to be carefully guided by the characteristics of the algorithms, graphs and hardware. Furthermore, in-memory systems are often limited by the amount of available memory on a single machine. When the graph cannot fit in the available DRAM, many systems scale up to secondary storage on one machine, or in the cloud. As storage is cheaper than memory, they trade off performance for more space, at a lower cost. Emerging non-volatile technologies such as 3D XPoint, offer a new opportunity for bridging this performance gap. Designing a system that fully utilises these storage devices is not straightforward. Traditional I/O optimisations, designed for SSDs, underutilise the device, and systems end up being CPU bound on fast storage. By removing the dedicated I/O layers, and combining pre-processing approaches for in-memory and out-of-core systems, we are able to switch graph representations to benefit a particular algorithm. This improves the end-to-end execution time up to 2x. However, in the presence of updates to the graph structure, the data structures used by static algorithms need to be re-created on every update, and the algorithm executed from scratch. The high latency of this process is not acceptable for critical applications such as fraud detection. We address this problem by developing two systems to compute on evolving graphs, using an update friendly graph representation. Each system targets a different group of applications: graph analytics and graph pattern mining (GPM). For graph analytics we trade sub-millisecond latencies for consistency. For GPM, we use re-computation and backtracking to handle millions of updates per second, outperforming state of the art by up to 5x.

EPFL2019

Parallel retrieval of correlated patterns: From Hopfield networks to Boltzmann machines

Andrea De Antoni

In this work, we first revise some extensions of the standard Hopfield model in the low storage limit, namely the correlated attractor case and the multitasking case recently introduced by the authors. The former case is based on a modification of the Hebbian prescription, which induces a coupling between consecutive patterns and this effect is tuned by a parameter a. In the latter case, dilution is introduced in pattern entries, in such a way that a fraction d of them is blank. Then, we merge these two extensions to obtain a system able to retrieve several patterns in parallel and the quality of retrieval, encoded by the set of Mattis magnetizations {m(mu)}, is reminiscent of the correlation among patterns. By tuning the parameters d and a, qualitatively different outputs emerge, ranging from highly hierarchical to symmetric. The investigations are accomplished by means of both numerical simulations and statistical mechanics analysis, properly adapting a novel technique originally developed for spin glasses, i.e. the Hamilton-Jacobi interpolation, with excellent agreement. Finally, we show the thermodynamical equivalence of this associative network with a (restricted) Boltzmann machine and study its stochastic dynamics to obtain even a dynamical picture, perfectly consistent with the static scenario earlier discussed. (c) 2012 Elsevier Ltd. All rights reserved.

Elsevier2013

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

Jasmina Malicevic

EPFL2019