Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Séance de cours

Mettre fin à la diffusion fiable et NBAC

Dans cours

CS-451: Distributed algorithms

Computing is nowadays distributed over several machines, in a local IP-like network, a cloud or a P2P network. Failures are common and computations need to proceed despite partial failures of machines or communication links. This course will study the fo ...

Description

Cette séance de cours couvre la fin de la diffusion fiable (TRB) et du comité atomique non bloquant (NBAC). TRB est une primitive de communication utilisée pour diffuser des messages de manière fiable entre les processus, tandis que NBAC se concentre sur la conclusion d'un accord sur le fait de commettre ou d'annuler des transactions dans un système distribué. La séance de cours explique les concepts, les algorithmes et les propriétés de TRB et NBAC, y compris l'intégrité, la validité, l'accord, la résiliation et le consensus. Il traite également de l'utilisation de détecteurs de défaillance et d'algorithmes de consensus dans la réalisation d'un commit atomique non bloquant. La présentation se termine par un aperçu historique des protocoles de validation atomique et de leurs complexités.

Cette vidéo est disponible exclusivement sur Mediaspace pour un public restreint. Veuillez vous connecter à Mediaspace pour y accéder si vous disposez des autorisations nécessaires.

Regarder sur Mediaspace

Enseignant·e

Rachid Guerraoui

Rachid Guerraoui has been affiliated with Ecole des Mines of Paris, the Commissariat à l'Energie Atomique of Saclay, Hewlett Packard Laboratories and the Massachusetts Institute of Technology. He has worked in a variety of aspects of distributed computing, including distributed algorithms and distributed programming languages. He is most well known for his work on (e-)Transactions, epidemic information dissemination and indulgent algorithms. He co-authored a book on Transactional Systems (Hermes) and a book on reliable distributed programming (Springer). He was appointed program chair of ECOOP 1999, ACM Middleware 2001, IEEE SRDS 2002, DISC 2004 and ACM PODC 2010. His publications are available at http://lpdwww.epfl.ch/rachid/papers/generalPublis.html

Source officielle

Proximité ontologique

Génie informatique

Calcul intensif: Calcul distribué

Concepts associés (32)

Two-phase commit protocol

In transaction processing, databases, and computer networking, the two-phase commit protocol (2PC, tupac) is a type of atomic commitment protocol (ACP). It is a distributed algorithm that coordinates all the processes that participate in a distributed atomic transaction on whether to commit or abort (roll back) the transaction. This protocol (a specialised type of consensus protocol) achieves its goal even in many cases of temporary system failure (involving either process, network node, communication, etc.

Commitment ordering

Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related applications. It allows optimistic (non-blocking) implementations. With the proliferation of multi-core processors, CO has also been increasingly utilized in concurrent programming, transactional memory, and software transactional memory (STM) to achieve serializability optimistically. CO is also the name of the resulting transaction schedule (history) property, defined in 1988 with the name dynamic atomicity.

Atomic commit

In the field of computer science, an atomic commit is an operation that applies a set of distinct changes as a single operation. If the changes are applied, then the atomic commit is said to have succeeded. If there is a failure before the atomic commit can be completed, then all of the changes completed in the atomic commit are reversed. This ensures that the system is always left in a consistent state. The other key property of isolation comes from their nature as atomic operations.

Three-phase commit protocol

In computer networking and databases, the three-phase commit protocol (3PC) is a distributed algorithm which lets all nodes in a distributed system agree to commit a transaction. It is a more failure-resilient refinement of the two-phase commit protocol (2PC). A two-phase commit protocol cannot dependably recover from a failure of both the coordinator and a cohort member during the Commit phase. If only the coordinator had failed, and no cohort members had received a commit message, it could safely be inferred that no commit had happened.

Database transaction

A database transaction symbolizes a unit of work, performed within a database management system (or similar system) against a database, that is treated in a coherent and reliable way independent of other transactions. A transaction generally represents any change in a database. Transactions in a database environment have two main purposes: To provide reliable units of work that allow correct recovery from failures and keep a database consistent even in cases of system failure.

Afficher plus

Séances de cours associées (32)

Agent Gitlab pour Kubernetes (agentk)

Couvre la configuration d'un agent Gitlab pour Kubernetes, en mettant l'accent sur l'installation, le contrôle de version et le dépannage.

Réplication et consensus dans les systèmes distribués

Explore la réplication, le consensus, l'algorithme Paxos, le consensus majoritaire et la réservation d'arrêt dans les systèmes distribués.

Résoudre les jeux de parité dans la pratique

Explore les aspects pratiques de la résolution des jeux de parité, y compris les stratégies gagnantes, les algorithmes, la complexité, le déterminisme et les approches heuristiques.

Architecture de CockroachDB Connectez-vous à Mediaspace pour regarder cette vidéo

Explore l'architecture de CockroachDB, en se concentrant sur la gestion des transactions, le contrôle de la concurrence et l'évolutivité.

Opérations distribuées : principes et protocoles Connectez-vous à Mediaspace pour regarder cette vidéo

Explore les transactions distribuées, couvrant les principes, les protocoles, le contrôle de la concordance, le commit et la réplication.

Afficher plus

Concepts associés (32)

Two-phase commit protocol

Commitment ordering

Atomic commit

Three-phase commit protocol

Database transaction

Afficher plus