Publications associées à Tradeoffs between False Sharing and Aggregation in Software Distributed Shared Memory

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

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

SoK: Shining Light on Shadow Stacks

Mathias Josef Payer, Xiangyu Zhang

Control-Flow Hijacking attacks are the dominant attack vector against C/C++ programs. Control-Flow Integrity (CFI) solutions mitigate these attacks on the forward edge, i.e., indirect calls through function pointers and virtual calls. Protecting the backwa ...

IEEE COMPUTER SOC2019

Passing Messages while Sharing Memory

Rachid Guerraoui, Naama Ben David

We introduce a new distributed computing model called m&m that allows processes to both pass messages and share memory. Motivated by recent hardware trends, we find that this model improves the power of the pure message-passing and shared-memory models. As ...

ASSOC COMPUTING MACHINERY2018

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Matthaios Alexandros Olma

The execution of spatial range queries is at the core of many applications, particularly in the simulation sciences but also in many other domains. Although main memory in desktop and supercomputers alike has grown considerably in recent years, most spatia ...

2017

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Matthaios Alexandros Olma

ACM New York, NY, USA2017

Near-Memory Address Translation

Babak Falsafi, Javier Picorel Obando

Memory and logic integration on the same chip is becoming increasingly cost effective, creating the opportunity to offload data-intensive functionality to processing units placed inside memory chips. The introduction of memory-side processing units (MPUs) ...

Ieee2017

A paradox of eventual linearizability in shared memory

Rachid Guerraoui, Eric Ruppert

This paper compares, for the rst time, the computational power of linearizable objects with that of eventually linearizable ones. We present the following paradox. We show that, unsurprisingly, no set of eventually linearizable objects can (1) implement an ...

ACM Press2014

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

Tradeoffs between False Sharing and Aggregation in Software Distributed Shared Memory

Graph Chatbot

Chattez avec Graph Search

Pythia: Remote Oracles for the Masses

SoK: Shining Light on Shadow Stacks

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

Passing Messages while Sharing Memory

Near-Memory Address Translation

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

Near-Memory Address Translation

A paradox of eventual linearizability in shared memory

Enabling efficient OS paging for main-memory OLTP databases

Near-Memory Address Translation

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

A paradox of eventual linearizability in shared memory

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

SoK: Shining Light on Shadow Stacks

Enabling efficient OS paging for main-memory OLTP databases

Passing Messages while Sharing Memory

Near-Memory Address Translation

Pythia: Remote Oracles for the Masses