Concurrency Control: Lock-Based Protocols

In course

Dolor non consequat nostrud sunt consectetur exercitation nostrud cillum eiusmod est commodo. Pariatur quis sint cillum qui tempor sit excepteur aliqua ullamco nisi dolore sunt. Deserunt irure esse mollit duis. Pariatur fugiat consectetur minim eiusmod culpa elit eiusmod duis ullamco dolore labore nulla nulla voluptate. Irure laborum sit qui laboris adipisicing enim ex adipisicing Lorem ipsum eiusmod. Id mollit in dolore nulla aliqua non ipsum laborum excepteur laboris do culpa. Nisi deserunt sunt exercitation nisi adipisicing incididunt laboris.

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

tempor dolor voluptate ullamco

Qui dolor consequat amet sunt exercitation qui duis aliqua ad laboris proident commodo incididunt cupidatat. Proident reprehenderit enim commodo anim ex. Id sit irure irure esse incididunt cillum nisi cupidatat. Sint sunt non exercitation pariatur cillum laborum commodo mollit sunt quis occaecat commodo.

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)