Publications related to Highly Dynamic Distributed Computing with Byzantine Failures

193 MOPS/mW @ 162 MOPS, 0.32V to 1.15V voltage range multi-core accelerator for energy efficient parallel and sequential digital processing

Andreas Peter Burg, Adam Shmuel Teman, Luca Benini, Jeremy Hugues-Felix Constantin

Low power (mW) and high performance (GOPS) are strong requirements for compute-intensive signal processing in E-health, Internet-of-Things, and wearable applications. This work presents a building block for programmable Ultra-Low Power accelerators, namely ...

Ieee2016

Beyond One Third Byzantine Failures

Rachid Guerraoui, Anne-Marie Kermarrec, Cheng Wang

The Byzantine agreement problem requires a set of

n

processes to agree on a value sent by a transmitter, despite a subset of

b

processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system. It ...

2015

Byzantine Agreement with Homonyms

Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general mo ...

Springer2013

Implementation of a Distributed Computation Framework

Matej Pavlovic

This project aims at building a dynamic and scalable framework for Byzantine fault tolerant distributed computation. By organizing nodes of a distributed system in fault-tolerant clusters, we mask Byzantine failures of single nodes and provide an abstracti ...

2013

HydEE: Failure Containment without Event Logging for Large Scale Send-Deterministic MPI Applications

Thomas Ropars

High performance computing will probably reach exascale in this decade. At this scale, mean time between failures is expected to be a few hours. Existing fault tolerant protocols for message passing applications will not be efficient anymore since they eit ...

2012

Multiscale Hemodynamics Using GPU Clusters

Efthimios Kaxiras

The parallel implementation of MUPHY, a concurrent multiscale code for large-scale hemodynamic simulations in anatomically realistic geometries, for multi-GPU platforms is presented. Performance tests show excellent results, with a nearly linear parallel s ...

Cambridge University Press2012

Byzantine agreement with homonyms

Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general mo ...

ACM Press2011

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized ...

IEEE2011

Greedy Scheduling for Distributed Computing Clusters

Amin Karbasi, Milan Vojnovic

Allocating tasks to machines in computing clusters is described. In an embodiment a set of tasks associated with a job are received at a scheduler. In an embodiment an index can be computed for each combination of tasks and processors and stored in a looku ...

2011

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for the algorithms we analyzed, in most cases, the decentralized variant ...

2010

Highly Dynamic Distributed Computing with Byzantine Failures

Graph Chatbot

Chat with Graph Search

193 MOPS/mW @ 162 MOPS, 0.32V to 1.15V voltage range multi-core accelerator for energy efficient parallel and sequential digital processing

Beyond One Third Byzantine Failures

Byzantine Agreement with Homonyms

Implementation of a Distributed Computation Framework

HydEE: Failure Containment without Event Logging for Large Scale Send-Deterministic MPI Applications

Multiscale Hemodynamics Using GPU Clusters

Byzantine agreement with homonyms

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

Greedy Scheduling for Distributed Computing Clusters

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Implementation of a Distributed Computation Framework

Greedy Scheduling for Distributed Computing Clusters

193 MOPS/mW @ 162 MOPS, 0.32V to 1.15V voltage range multi-core accelerator for energy efficient parallel and sequential digital processing

Beyond One Third Byzantine Failures

Byzantine agreement with homonyms

Multiscale Hemodynamics Using GPU Clusters

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Byzantine Agreement with Homonyms

HydEE: Failure Containment without Event Logging for Large Scale Send-Deterministic MPI Applications