Publications associées à Non-blocking algorithm

Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous ap- proaches are typically tran ...

USENIX Association2018

Log-Free Concurrent Data Structures

Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David

USENIX ASSOC2018

Convex Optimization using Sparsified Stochastic Gradient Descent with Memory

Jean-Baptiste Francis Marie Juliette Cordonnier

The interest for distributed stochastic optimization has raised to train complex Machine Learning models with more data on distributed systems. Increasing the computation power speeds up the training but it faces a communication bottleneck between workers ...

2018

Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store

Willy Zwaenepoel, Diego Didona, Kristina Spirovska

Transactional Causal Consistency (TCC) extends causal consistency, the strongest consistency model compatible with availability, with interactive read-write transactions, and is therefore particularly appealing for geo-replicated platforms. This paper pres ...

2018

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

Elastic transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

Academic Press Inc Elsevier Science2017

Precisely Regulated and Efficient Locking of Linear Peptides into Stable Multicyclic Topologies through a One-Pot Reaction

Christian Heinis, Xudong Kong

We report the discovery of a small phenyl molecule with four isosteric thiolate-reactive groups of sequentially varied reactivity. This molecule was exploited in combination with cysteine/penicillamine thiolates of different nucleophilic reactivity for pre ...

Wiley-Blackwell2017

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

Rachid Guerraoui, Vasileios Trigonakis, Karolos Antoniadis, Julien Michel Stainer

Establishing the scalability of a concurrent algorithm a priori, before implementing and evaluating it on a concrete multi-core platform, seems difficult, if not impossible. In the context of search data structures however, according to all practical work ...

Springer International Publishing2017

Classifying Functions with Exact Synthesis

Giovanni De Micheli, Mathias Soeken, Eleonora Testa, Winston Jason Haaswijk

Due to recent advances, constraint solvers have become efficient tools for synthesizing optimum Boolean circuits. We take advantage of this by showing how SAT based exact synthesis may be used as a method for finding minimum length Boolean chains. As oppos ...

IEEE2017

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.

Non-blocking algorithm

Log-Free Concurrent Data Structures

Log-Free Concurrent Data Structures

Convex Optimization using Sparsified Stochastic Gradient Descent with Memory

Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store

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

Universally Scalable Concurrent Data Structures

Elastic transactions

Precisely Regulated and Efficient Locking of Linear Peptides into Stable Multicyclic Topologies through a One-Pot Reaction

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

Classifying Functions with Exact Synthesis

Graph Chatbot

Chattez avec Graph Search

Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store

Log-Free Concurrent Data Structures

Log-Free Concurrent Data Structures

Universally Scalable Concurrent Data Structures

Elastic transactions

Precisely Regulated and Efficient Locking of Linear Peptides into Stable Multicyclic Topologies through a One-Pot Reaction

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

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

Convex Optimization using Sparsified Stochastic Gradient Descent with Memory

Classifying Functions with Exact Synthesis