Lecture

Decentralized Systems Engineering: Gossip Efficiency

Graph Chat

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.

In course

CS-438: Decentralized systems engineering

A decentralized system is one that works when no single party is in charge or fully trusted. This course teaches decentralized systems principles while guiding students through the engineering of their own decentralized system featuring messaging, file sha ...

Description

This lecture covers the concept of gossiping in decentralized systems, focusing on minimizing duplication and reducing traffic through comparing sets of messages. It delves into improved gossiping techniques such as rumor mongering and anti-entropy to ensure message dissemination. Quality measures, residue, and applications of gossip in metadata propagation and group membership are discussed. The lecture also explores decentralized search algorithms, the development of Gnutella, standard algorithms, optimizations like BubbleStorm, and next steps for further study.

Instructors (2)

Pierluca Borsò

Expertise Teaching & PhD Courses Decentralized systems engineering CS-438 A decentralized system is one that works when no single party is in charge or fully trusted. This course teaches decentralized systems principles while guiding students through the engineering of their own decentralized system featuring messaging, file sharing, encryption, and blockchain concepts.

Bryan Alexander Ford

Links DEDIS lab home pagePersonal home page Curriculum vitae https://bford.info/cv.pdf Teaching & PhD PhD Students Shailesh Mishra Past EPFL PhD Students Eleftherios Kokoris Kogias, Kirill Nikitin, Cristina Basescu, Enis Ceyhun Alp, Simone Colombo, Pasindu Nivanthaka Tennage, Louis-Henri Manuel Jakob Merino Past EPFL PhD Students as codirector David Froelicher, Ludovic Barman, Georgia Fragkouli Courses Decentralized systems engineering CS-438 A decentralized system is one that works when n

Official source

Related concepts (32)

Optimizing compiler

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution time, memory footprint, storage size, and power consumption (the last three being popular for portable computers). Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources or executes faster.

Program optimization

In computer science, program optimization, code optimization, or software optimization, is the process of modifying a software system to make some aspect of it work more efficiently or use fewer resources. In general, a computer program may be optimized so that it executes more rapidly, or to make it capable of operating with less memory storage or other resources, or draw less power. Although the word "optimization" shares the same root as "optimal", it is rare for the process of optimization to produce a truly optimal system.

Peephole optimization

Peephole optimization is an optimization technique performed on a small set of compiler-generated instructions; the small set is known as the peephole or window. Peephole optimization involves changing the small set of instructions to an equivalent set that has better performance.

Loop optimization

In compiler theory, loop optimization is the process of increasing execution speed and reducing the overheads associated with loops. It plays an important role in improving cache performance and making effective use of parallel processing capabilities. Most execution time of a scientific program is spent on loops; as such, many compiler optimization techniques have been developed to make them faster. Since instructions inside loops can be executed repeatedly, it is frequently not possible to give a bound on the number of instruction executions that will be impacted by a loop optimization.

Interprocedural optimization

Interprocedural optimization (IPO) is a collection of compiler techniques used in computer programming to improve performance in programs containing many frequently used functions of small or medium length. IPO differs from other compiler optimizations by analyzing the entire program as opposed to a single function or block of code. IPO seeks to reduce or eliminate duplicate calculations and inefficient use of memory and to simplify iterative sequences such as loops.

Related lectures (59)

Optimizing Recursive Queries

Explores optimizing recursive queries in database systems using Datalog and semirings, discussing the challenges and solutions in data analytics.

Microcontrollers: Specific Operations

Covers microcontroller programming, memory protection, code optimization, debugging, project management, and hardware control.

Gossip Efficiency: Decentralized Systems

Explores gossip efficiency in decentralized systems, covering protocols, interaction needs, and bandwidth optimization, along with search algorithms and optimizations.

Distributed Information Retrieval

Explores centralized and distributed information retrieval, including Fagin's Algorithm for efficient document identification.

Code Optimization: Speeding-up Analyses

Explores techniques to speed up dataflow analyses and discusses the importance of node ordering and post-order traversal.