Computer memory | EPFL Graph Search

Computer memory stores information, such as data and programs for immediate use in the computer. The term memory is often synonymous with the term primary storage or main memory. An archaic synonym for memory is store. Computer memory operates at a high speed compared to storage which is slower but less expensive and higher in capacity. Besides storing opened programs, computer memory serves as disk cache and write buffer to improve both reading and writing performance. Operating systems borrow RAM capacity for caching so long as not needed by running software. If needed, contents of the computer memory can be transferred to storage; a common way of doing this is through a memory management technique called virtual memory. Modern computer memory is implemented as semiconductor memory, where data is stored within memory cells built from MOS transistors and other components on an integrated circuit. There are two main kinds of semiconductor memory: volatile and non-volatile. Examples

Theories of topologically-induced phenomena in skyrmion-hosting magnetoelectric insulators

Oleksandr Kriuchkov

There once was a harsh competition between different computer memory technologies, and now we cheer triumph for the Random Access-Memory (RAM) devices, -- cheap, fast, tiny, stable. The competing Magnetic Bubble Memory had faded away as magnetic bubbles are undesirably large and pretty much not robust, manifesting both low data density and high operational costs. However, what we do possess now are nanosize objects of topological nature, magnetic skyrmions, which are protected from continuous field variations and take very little energy cost to be moved. Thus, skyrmions are considered as promising information carriers for future memory devices and ultradense data storage, while skyrmion phases in bulk materials are interesting from fundamental point of view in exploring topological states of matter. In this thesis, I develop and advance several effective theoretical approaches, diverse both in their methods and use, which were of appeal for several skyrmionic experiments in our lab (LQM/EPFL). We were and are primarily interested in the open issues in the applied field of skyrmionics, which may be taken under the umbrella of creation, stabilization and control of magnetic skyrmions under electric fields, mechanical strains, thermal gradients, etc. For the goals achieved and yet to be achieved, the magnetoelectric insulator Cu2OSeO3, which uniquely responses to all the above mentioned fields, is a highly advantageous candidate. Magnetoelectric here means that the spins of a magnetic material are coupled to external electric fields, while insulating properties are very advantageous to preserve both the state and the very existence of skyrmions by eliminating the Joule heating. The novel results in this thesis are calculations for both individual and arrayed skyrmions under electric fields, mechanical strains and uniform pressures, and thermal gradients. Furthermore, several fundamental questions were addressed by developing an extended formalism for calculation skyrmion-pocket phase diagrams, studying the topologically-governed crossover between skyrmions and magnetic bubbles, and discussing the possible role of merons (half-skyrmions) in skyrmion phase formation. The result with the most immediate appeal is probably the theoretical and experimental study of skyrmion lattices in electric fields, with a direct demonstration of writing and erasing of the full skyrmion phase under electric fields of few Volts per micrometer, as compatible with modern microelectronic devices.

EPFL2017

Software Support for Non-Volatile Memory (NVM) Programming

David Teksen Aksun

Non-Volatile Memory (NVM) is an emerging type of memory device that provides fast, byte-addressable, and high-capacity durable storage. NVM sits on the memory bus and allows durable data structures designs similar to the in-memory equivalent ones. Expensive serialization/deserialization operations, usually associated with block-based storage, are not necessary. Unfortunately, using NVM is not as simple as placing a data structure in NVM and expecting persistence. As NVM sits on the memory bus, processor caches buffer the cache lines from it that are referenced by load and store instructions. The volatility of the caches and possible power failures at a random point in a program complicate the design and require ways to handle these failures. Prior work focused on implementing crash-consistency mechanisms to correctly recover a program's data after a failure. The goal was to minimize the use of costly cache line write-back and fence instructions, which are necessary for correct durability. Moreover, commercial NVM devices are slower compared to DRAM and affect the design. In addition to performance overheads, correctly implementing crash consistency is hard. The programmers need to carefully reason about cache line write-back instructions and the order of persistent writes. Finding bugs can take from minutes to hours. In this thesis, we use checkpointing as an effective crash-consistency mechanism with low overhead for building durable data structures. We also describe an inter-procedural dataflow analysis for fast detection of NVM programming bugs. We show the practicality of these ideas through three primary contributions and their implementations. Firstly, we present InCLL to address NVM checkpointing. InCLL is a novel technique that uses fine-grained checkpointing and in-cache-line logging to minimize the number of explicit write-back and fence instructions in the fast path of data structure modifications. We evaluate InCLL both on DRAM and Optane devices for the Masstree data structure. Secondly, we present a new checkpointing design, CpNvm, which minimizes NVM write-back instructions on the critical path of the execution. We achieve low overheads for Masstree and Memcached for write-heavy workloads, and almost no overheads for read-only workloads. In addition, we present FlowNvm to find NVM programming bugs. FlowNvm can identify NVM programming pattern violations and anti-patterns at compile-time using inter-procedural dataflow analysis.

EPFL2021