Concept

Temps partagé

Publications associées (64)

Placement of Virtual Containers on NUMA systems: A Practical and Comprehensive Model

Our work addresses the problem of placement of threads, or virtual cores, onto physical cores in a multicore NUMA system. Different placements result in varying degrees of contention for shared resources, so choosing the right placement can have a large ef ...

2018

Placement of Virtual Containers on NUMA systems: A Practical and Comprehensive Model

Baptiste Joseph Eustache Lepers

USENIX ASSOC2018

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

Compute-forward multiple access (CFMA) with nested LDPC codes

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore

Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages ...

2017

Gaussian Multiple Access via Compute-and-Forward

Michael Christoph Gastpar, Jingge Zhu

Lattice codes used under the compute-and-forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): the receiver succes- sively decodes the integer linear combinations of the messages until it can invert and r ...

Institute of Electrical and Electronics Engineers2017

Multicloud Resource Allocation

Hao Zhuang

Nowadays our daily life is not only powered by water, electricity, gas and telephony but by "cloud" as well. Big cloud vendors such as Amazon, Microsoft and Google have built large-scale centralized data centers to achieve economies of scale, on-demand res ...

EPFL2017

Safe and Efficient Deployment of Data-Parallelisable Applications on Many-Core Platforms: Theory and Practice

Giovanni De Micheli, Federico Angiolini, Alena Simalatsar, Stefanos Skalistis

The safe and, at the same time, efficient deployment of parallelisable applications on many-core platforms is a challenging task. Theoretical Models of Computation (MoC) require the realistic estimation of task Worst-Case Execution Time (WCET ...

2017

Multi-Library Coded Caching

Michael Christoph Gastpar, Saeid Sahraei

We study the problem of coded caching when the server has access to several libraries and each user makes independent requests from every library. The single-library scenario has been well studied and it has been proved that coded caching can significantly ...

2016

Controlling the Long-Range Corrections in Atomistic Monte Carlo Simulations of Two-Phase Systems

Dominic John Tildesley

The long-range correction to the surface tension can amount to up to 55% of the calculated value of the surface tension for cutoffs in the range of 2.1-6.4 sigma. The calculation of the long-range corrections to the surface tension and to the configuration ...

Amer Chemical Soc2015

BestOf Architectural Design 2015 Students' projects competition

Cet ouvrage présente 26 projets d’étudiants en architecture représentatifs de la vaste réflexion architecturale et urbanistique issue chaque année des ateliers de l’École polytechnique fédérale de Lausanne. En plus de sa mission d’enseignement, l’EPFL ...

Archizoom2015

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search