Publications associées à Models of communication

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.

Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication

Martin Jaggi, Sebastian Urban Stich, Anastasiia Koloskova

We consider decentralized stochastic optimization with the objective function (e.g. data samples for machine learning task) being distributed over n machines that can only communicate to their neighbors on a fixed communication graph. To reduce the communi ...

2019

SBFT: a Scalable and Decentralized Trust Infrastructure

Dragos-Adrian Seredinschi

SBFT is a state of the art Byzantine fault tolerant state machine replication system that addresses the challenges of scalability, decentralization and global geo-replication. SBFT is optimized for decentralization and is experimentally evaluated on a depl ...

IEEE COMPUTER SOC2019

Exploring The Borderlands Of The Gathering Problem

Rachid Guerraoui, El Mahdi El Mhamdi, Alexandre David Olivier Maurer, Vladislav Tempez

Problems of pattern formation have been extensively studied in distributed computing. One of this problems is the gathering problem: agents must gather at a same position in a distributed manner. When gathering is not possible, a close problem is the conve ...

2019

Fully-Asynchronous Cache-Efficient Simulation of Detailed Neural Networks

Felix Schürmann, Michael Lee Hines

Modern asynchronous runtime systems allow the re-thinking of large-scale scientific applications. With the example of a simulator of morphologically detailed neural networks, we show how detaching from the commonly used bulk-synchronous parallel (BSP) exec ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Communication trade-offs for Local-SGD with large step size

Aymeric Daphnis Kévin Dieuleveut

Synchronous mini-batch SGD is state-of-the-art for large-scale distributed machine learning. However, in practice, its convergence is bottlenecked by slow communication rounds between worker nodes. A natural solution to reduce communication is to use the " ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

Formal Approaches to Querying Big Data in Shared-Nothing Systems

Bas Ketsman

To meet today's data management needs, it is a widespread practice to use distributed data storage and processing systems. Since the publication of the MapReduce paradigm, a plethora of such systems arose, but although widespread, the capabilities of these ...

ASSOC COMPUTING MACHINERY2019

Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering

Rajai Nasser

The ordering of communication channels was first introduced by Shannon. In this paper, we aim to find characterizations of two orderings: input-degradedness and the Shannon ordering. A channel W is said to be input-degraded from another channel W' if W can ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Adventures in Monotone Complexity and TFNP

Mika Tapani Göös, Dmitrii Sokolov

Separations: We introduce a monotone variant of Xor-Sat and show it has exponential monotone circuit complexity. Since Xor-Sat is in NC^2, this improves qualitatively on the monotone vs. non-monotone separation of Tardos (1988). We also show that monotone ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2018

Models of communication

Graph Chatbot

Chattez avec Graph Search

Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication

SBFT: a Scalable and Decentralized Trust Infrastructure

Exploring The Borderlands Of The Gathering Problem

Fully-Asynchronous Cache-Efficient Simulation of Detailed Neural Networks

Communication trade-offs for Local-SGD with large step size

Formal Approaches to Querying Big Data in Shared-Nothing Systems

A hybrid framework for industrial data storage and exploitation

Bits through Time

Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering

Adventures in Monotone Complexity and TFNP

SBFT: a Scalable and Decentralized Trust Infrastructure

Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication

Formal Approaches to Querying Big Data in Shared-Nothing Systems

Communication trade-offs for Local-SGD with large step size

Bits through Time

Exploring The Borderlands Of The Gathering Problem

A hybrid framework for industrial data storage and exploitation

Fully-Asynchronous Cache-Efficient Simulation of Detailed Neural Networks

Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering

Adventures in Monotone Complexity and TFNP