Publications associées à Distributed shared memory

Parallel algorithms for tensor completion in the CP format

Low-rank tensor completion addresses the task of filling in missing entries in multidimensional data. It has proven its versatility in numerous applications, including context aware recommender systems and multivariate function learning. To handle large-sc ...

Elsevier Science Bv2016

Scale-out non-uniform memory access

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic

A computing system that uses a Scale-Out NUMA (“soNUMA”) architecture, programming model, and/or communication protocol provides for low-latency, distributed in-memory processing. Using soNUMA, a programming model is layered directly on top of a NUMA memor ...

2015

Leveraging Hardware Message Passing for Efficient Thread Synchronization

André Schiper, Thomas Ropars, Darko Petrovic

As the level of parallelism in manycore processors keeps increasing, providing efficient mechanisms for thread synchronization in concurrent programs is becoming a major concern. On cache-coherent shared-memory processors, synchronization efficiency is ult ...

2014

Leveraging Hardware Message Passing for Efficient Thread Synchronization

André Schiper, Thomas Ropars, Darko Petrovic

Assoc Computing Machinery2014

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

Scale-Out NUMA

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic

Emerging datacenter applications operate on vast datasets that are kept in DRAM to minimize latency. The large number of servers needed to accommodate this massive memory footprint requires frequent server-to-server communication in applications such as ke ...

2014

Virtual Ways: Low-Cost Coherence for Instruction Set Extensions with Architecturally Visible Storage

Edoardo Charbon, Paolo Ienne, Ties Jan Henderikus Kluter, Samuel Burri, Philip Brisk

Instruction set extensions (ISEs) improve the performance and energy consumption of application-specific processors. ISEs can use architecturally visible storage (AVS), localized compiler-controlled memories, to provide higher I/O bandwidth than reading da ...

Assoc Computing Machinery2014

Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads

Martin Odersky, Aleksandar Prokopec

We present a work-stealing algorithm for runtime scheduling of data-parallel operations in the context of shared-memory architectures on data sets with highly-irregular workloads that are not known a priori to the scheduler. This scheduler can parallelize ...

Springer-Verlag Berlin2014

DiNoDB: Efficient Large-Scale Raw Data Analytics

Anastasia Ailamaki, Marko Vukolic, Ioannis Alagiannis, Erietta Liarou, Yongchao Tian

Modern big data workflows, found in e.g., machine learning use cases, often involve iterations of cycles of batch analytics and interactive analytics on temporary data. Whereas batch analytics solutions for large volumes of raw data are well established (e ...

2014

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.

Distributed shared memory

Parallel algorithms for tensor completion in the CP format

Efficient Communication and Synchronization on Manycore Processors

Scale-out non-uniform memory access

Leveraging Hardware Message Passing for Efficient Thread Synchronization

Leveraging Hardware Message Passing for Efficient Thread Synchronization

A paradox of eventual linearizability in shared memory

Scale-Out NUMA

Virtual Ways: Low-Cost Coherence for Instruction Set Extensions with Architecturally Visible Storage

Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads

DiNoDB: Efficient Large-Scale Raw Data Analytics

Graph Chatbot

Chattez avec Graph Search

Parallel algorithms for tensor completion in the CP format

A paradox of eventual linearizability in shared memory

Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads

Leveraging Hardware Message Passing for Efficient Thread Synchronization

Leveraging Hardware Message Passing for Efficient Thread Synchronization

Efficient Communication and Synchronization on Manycore Processors

Scale-Out NUMA

Scale-out non-uniform memory access

Virtual Ways: Low-Cost Coherence for Instruction Set Extensions with Architecturally Visible Storage

DiNoDB: Efficient Large-Scale Raw Data Analytics