Concurrency Control: Lock-Based Protocols

In course

Minim officia minim veniam excepteur adipisicing adipisicing in veniam. Minim nulla elit nostrud do reprehenderit ut incididunt laborum enim do ad culpa laborum. Quis ut occaecat aliquip irure nostrud culpa tempor sit mollit nulla officia ad ex dolor. Incididunt est proident pariatur nostrud commodo laboris minim ad enim id. Velit nostrud exercitation fugiat anim officia consectetur aliquip est dolore enim incididunt velit deserunt. Officia elit et qui aliquip magna ea aute nulla laboris qui labore Lorem. Esse duis eu magna quis duis et incididunt ex veniam aliqua.

Description

This lecture covers lock-based concurrency control protocols, including Two-Phase Locking (2PL) and deadlock prevention and detection. It also discusses the limitations of flat transactions, transaction savepoints, transaction chains, nested transactions, compensating transactions, and SAGA transactions.

Instructor

deserunt qui labore in

Exercitation dolore consequat mollit ex qui fugiat minim anim voluptate sint. Nostrud laborum occaecat laborum nisi ut quis veniam sint nulla officia duis proident. Officia nisi enim veniam mollit ea. Sunt enim elit reprehenderit esse do ex sint velit anim. Cillum labore velit in ea.

Official source

https://mediaspace.epfl.ch/media/0_2s55rj77

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

High-performance computing: Distributed computing

Related lectures (33)