Concept

Calcul distribué

Publications associées (860)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

PrefEdge: SSD Prefetcher for Large-Scale Graph Traversal

Amitabha Roy

Mining large graphs has now become an important aspect of multiple diverse applications and a number of computer systems have been proposed to provide runtime support. Recent interest in this area has led to the construction of single machine graph computa ...

2014

A parametric multi-convex splitting technique with application to real-time NMPC

Colin Neil Jones, Jean-Hubert Hours

A novel splitting scheme to solve parametric multi-convex programs is presented. It consists of a fixed number of proximal alternating minimisations and a dual update per time step, which makes it attractive in a real-time Nonlinear Model Predictive Contro ...

2014

Asymmetric Compute-and-Forward with CSIT

Michael Christoph Gastpar, Jingge Zhu

We present a modified compute-and-forward scheme which utilizes Channel State Information at the Transmitters (CSIT) in a natural way. The modified scheme allows different users to have different coding rates, and use CSIT to achieve larger rate region. Th ...

2014

Energy Efficiency through Significance-Based Computing

Andreas Peter Burg, Georgios Karakonstantis

An extension of approximate computing, significance-based computing exploits applications' inherent error resiliency and offers a new structural paradigm that strategically relaxes full computational precision to provide significant energy savings with min ...

Institute of Electrical and Electronics Engineers2014

Utility-Based Mechanism for Structural Self-Organization in Service-Oriented MAS

Matteo Vasirani

Structural relations established among agents influence the performance of decentralized service discovery process in multiagent systems. Moreover, distributed systems should be able to adapt their structural relations to changes in environmental condition ...

Assoc Computing Machinery2014

System and method for media library navigation and recommendation

Pierre Vandergheynst, Alexandre Massoud Alahi, Kirell Maël Benzi

The invention relates to a system and method to optimize navigation and recommendation in a distributed network of media libraries. According to the invention, it is proposed a system and a method to assist the selection of media items comprising the steps ...

2014

Online dictionary learning over distributed models

Ali H. Sayed

In this paper, we consider learning dictionary models over a network of agents, where each agent is only in charge of a portion of the dictionary elements. This formulation is relevant in big data scenarios where multiple large dictionary models may be spr ...

IEEE2014

LLR-based Successive Cancellation List Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming

We present an LLR-based implementation of the successive cancellation list (SCL) decoder. To this end, we associate each decoding path with a metric which (i) is a monotone function of the path’s likelihood and (ii) can be computed efﬁciently from the chan ...

Ieee2014

Compute-and-forward for discrete memoryless networks

Michael Christoph Gastpar

Consider a receiver that observes multiple interfering codewords. The compute-and-forward technique makes it possible for the receiver to directly decode linear combinations of the codewords. Previous work has focused on compute-and-forward for linear Gaus ...

2014

Asynchronous Gossip

Rachid Guerraoui, Seth Gilbert

We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. The algorithmic techniques prop ...

Association for Computing Machinery2013