Publication

A Topological Treatment of Early-Deciding Set-Agreement

Rachid Guerraoui, Bastian Pochon
2006
Conference paper

Abstract

This paper considers the k-set-agreement problem in a synchronous message passing distributed system where up to t processes can fail by crashing. We determine the number of communication rounds needed for all correct processes to reach a decision in a given run, as a function of k, the degree of coordination, and f

Official source

https://infoscience.epfl.ch/record/90534?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Topological Treatment of Early-Deciding Set-Agreement

Graph Chatbot

Chat with Graph Search

High-throughput screening of Weyl semimetals

Topological photonic transport in disordered scattering networks

Seeding and Emergence of Composite Skyrmions in a van der Waals Magnet

Seeding and Emergence of Composite Skyrmions in a van der Waals Magnet

Topological photonic transport in disordered scattering networks

High-throughput screening of Weyl semimetals