Partha Dutta

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (107)

Application of the Denovo Discrete Ordinates Radiation Transport Code to Large-Scale Fusion Neutronics

Patrick Blanchard, Basil Duval, Ambrogio Fasoli, Yves Martin, Richard Pitts, Olivier Sauter, Henri Weisen, Robin Humphry-Baker, Stefano Coda, Martinus Gijs, Partha Dutta, Marco Wischmeier, Jan Horacek, Vlad Trifa, Yann Camenen, Jonathan Graves, Duccio Testa, Miguel Fernández Ruiz, Sun Hee Kim, Mikhail Maslov, Javier García Hernández, David Pfefferlé, José Pedro Rebelo Ferreira Marques, Julio Rodriguez, Pedro Camilo de Oliveira e Silva, Rebecca Hill, Daniel Scott Alessi, Jonnathan Cesar Hidalgo Acosta, Ana Francisca Leal Silva Soares, Dalziel Joseph Wilson, Pierre-Thomas Paul Brun, Jonathan Marc Philippe Faustin, Federico Nespoli, Alberto Hernando de Castro, Hamish William Patten, Bruno Emanuel Ferreira De Sousa Correia, Li Shuai, Nicola Vianello, Antonio José Pereira de Figueiredo, , , , , , , , ,

Optimistic Erasure-Coded Distributed Storage

Rachid Guerraoui, Ron Levy, Partha Dutta

We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic ...

2008

The Time-Complexity of Local Decision in Distributed Agreement

Rachid Guerraoui, Bastian Pochon, Partha Dutta

Agreement is at the heart of distributed computing. In its simple form, it requires a set of processes to decide on a common value out of the values they propose. The time-complexity of distributed agreement problems is generally measured in terms of the n ...

2007

The Overhead of Consensus Failure Recovery

Rachid Guerraoui, Partha Dutta

Many reliable distributed systems are consensus-based and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery mode following asynchrony and failures. A lot of work has been devoted to optimize th ...

2007

How Fast Can Eventual Synchrony Lead to Consensus?

Rachid Guerraoui, Partha Dutta

2005

Time-complexity bounds on agreement problems

Partha Dutta

In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing efficient agreement algorithms is critical for improving th ...

EPFL2005

The Inherent Price of Indulgence

Rachid Guerraoui, Partha Dutta

This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of round-by-round fault d ...

2005

Page 6 sur 6

Samuel Lanthaler

Liang Yao

Arnout Lodewijk M Beckers

Fusion energy systems pose unique challenges to the modeling and simulation community. These challenges must be met to ensure the success of the ITER experimental fusion reactor. ITER's complex systems require detailed modeling that goes beyond the scale o ...

2018