Memory-mapped file

Applied sciences
Génie informatique
Calcul intensif
Système temps réel

Publications associées (22)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Pythia: Remote Oracles for the Masses

Mathias Josef Payer, Yuqing Zhang

Remote Direct Memory Access (RDMA) is a technology that allows direct access from the network to a machine's main memory without involving its CPU. RDMA offers low-latency, high-bandwidth performance and low CPU utilization. While RDMA provides massive per ...

USENIX ASSOC2019

A Novel Centralized Strategy for Coded Caching with Non-uniform Demands

Michael Christoph Gastpar, Saeid Sahraei, Pierre Victor Xavier Quinton

Despite significant progress in the caching literature concerning the worst case and uniform average case regimes, the algorithms for caching with nonuniform demands are still at a basic stage and mostly rely on simple grouping and memory-sharing technique ...

2018

SAT-Based Area Recovery in Structural Technology Mapping

Bruno Schmitt Antunes

This paper proposes a fast SAT-based algorithm for recovering area applicable to an already technology mapped circuit. The algorithm considers a sequence of relatively small overlapping regions, called windows, in a mapped network and tries to improve the ...

ASSOC COMPUTING MACHINERY2018

Design Guidelines for High-Performance SCM Hierarchies

Babak Falsafi, Edouard Bugnion, Alexandros Daglis, Javier Picorel Obando, Mark Johnathon Sutherland, Dmitrii Ustiugov, Dionysios Pnevmatikatos

With emerging storage-class memory (SCM) nearing commercialization, there is evidence that it will deliver the much-anticipated high density and access latencies within only a fewfactors of DRAM. Nevertheless, the latency-sensitive nature of memory-residen ...

ACM2018

Efficient Adaptive Hard Real-time Multi-processor Systems

Stefanos Skalistis

Modern computing systems are based on multi-processor systems, i.e. multiple cores on the same chip. Hard real-time systems are required to perform particular tasks within certain amount of time; failure to do so characterises an unaccepted behavior. Hard ...

EPFL2017

FloDB: Unlocking Memory in Persistent Key-Value Stores

Rachid Guerraoui, Mihail Igor Zablotchi, Vasileios Trigonakis, Oana Maria Balmau

Log-structured merge (LSM) data stores enable to store and process large volumes of data while maintaining good performance. They mitigate the I/O bottleneck by absorbing updates in a memory layer and transferring them to the disk layer in sequential batch ...

2017

Scaling Up Concurrent Analytical Workloads on Multi-Core Servers

Iraklis Psaroudakis

Today, an ever-increasing number of researchers, businesses, and data scientists collect and analyze massive amounts of data in database systems. The database system needs to process the resulting highly concurrent analytical workloads by exploiting modern ...

EPFL2016

Enabling efficient OS paging for main-memory OLTP databases

Anastasia Ailamaki, Radu Ioan Stoica

Even though main memory is becoming large enough to fit most OLTP databases, it may not always be the best option. OLTP workloads typically exhibit skewed access patterns where some records are hot (frequently accessed) but many records are cold (infrequen ...

2013

Simulation of High-Performance Memory Allocators

David Atienza Alonso, José Luis Risco Martin

Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern highperformance applications. To optimize metrics like performance, memory usage and energy consumption, software engineers often write custom allocators fr ...

IEEE Press2010

SPH High-Performance Computing simulations of rigid solids impacting the free-surface of water

François Avellan, Pierre Maruzewski

Numerical simulations of water entries based on a three-dimensional parallelized Smoothed Particle Hydrodynamics (SPH) model developed by Ecole Centrale Nantes are presented. The aim of the paper is to show how such SPH simulations of complex 3D problems i ...

Taylor & Francis Ltd2010

Page 2 sur 3