Concept

Publish-subscribe

Publications associées (38)

R2P2: Making RPCs first-class datacenter citizens

Edouard Bugnion, Evangelos Marios Kogias, Adrien Ghosn, Georgios Prekas, Jonas Fietz

Remote Procedure Calls are widely used to connect datacenter applications with strict tail-latency service level objectives in the scale of µs. Existing solutions utilize streaming or datagram-based transport protocols for RPCs that impose overheads and li ...

USENIX ASSOC2019

A Scalable and Secure System Architecture for Smart Buildings

Georgios Lilis

Recent years has seen profound changes in building technologies both in Europe and worldwide. With the emergence of Smart Grid and Smart City concepts, the Smart Building has attracted considerable attention and rapid development. The introduction of novel ...

EPFL2017

IntegrCiTy - D2.3 Report - Enabling and integrating a common IT structure: Definition of a back-end layer architecture

François Maréchal, Luc Girardin, Jessen Page, Gillian Jean Bernard Basso

The concept of the IntegrCiTy platform is built around the development of a single application as a suite of independent software: project partners will mutualize a certain number of tools that shall be integrated in the IntegrCiTy platform. Therefore, a r ...

IPESE-EPFL2017

Convolution Engine: Balancing Efficiency and Flexibility in Specialized Computing

Christos Kozyrakis

General-purpose processors, while tremendously versatile, pay a huge cost for their flexibility by wasting over 99% of the energy in programmability overheads. We observe that reducing this waste requires tuning data storage and compute structures and thei ...

2015

Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Karl Aberer, Ivana Podnar, Kresimir Pripuzic

Continuous processing of top-k queries over data streams is a promising technique for alleviating the information overload problem as it distinguishes relevant from irrelevant data stream objects with respect to a given scoring function over time. Thus it ...

Wiley-Blackwell2014

Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Karl Aberer, Kresimir Pripuzic

Pergamon-Elsevier Science Ltd2014

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

Degraded two-message multicast over graphs

Christina Fragouli, Shirin Saeedi Bidokhti

We consider communication of two degraded mes- sage sets over graphs where a common source sends two prioritized messages (a common and a private message) to several receivers. All receivers require the common message and a subset of the receivers require ...

2011

Continuous Query Evaluation over Distributed Sensor Networks

Karl Aberer, Sebastian Michel, Oana Anca Jurca, Alexandre Herrmann

In this paper we address the problem of processing continuous multi-join queries, over distributed data streams. Our approach makes use of existing work in the field of publish/subscribe systems. We show how these principles can be ported to our envisioned ...

IEEE2010

Toward Massive Query Optimization in Large-Scale Distributed Stream Systems

Karl Aberer

Existing distributed stream systems adopt a tightly-coupled communication paradigm and focus on fine-tuning of operator placements to achieve communication efficiency. This kind of approach is hard to scale (both to the nodes in the network and the users). ...

2008

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