Transactional Memory: Hardware Concurrency Control

This lecture covers the concept of transactional memory, focusing on hardware support for concurrency control. It discusses coarse-grained and fine-grained locking, their performance trade-offs, and difficulties. The instructor explains exercises on probability calculations for conflicting threads and the performance impact of different locking mechanisms. The lecture introduces the idea of lock elision and speculative execution to improve performance. It delves into hardware changes required for transactional memory, including speculative address tracking and conflict detection. The presentation concludes with a discussion on the benefits of hardware transactional memory and its implementation challenges.

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.

Related lectures (69)

Related concepts (44)

CS-307: Introduction to multiprocessor architecture

Multiprocessors are a core component in all types of computing infrastructure, from phones to datacenters. This course will build on the prerequisites of processor design and concurrency to introduce

Multiversion concurrency control

Multiversion concurrency control (MCC or MVCC), is a concurrency control method commonly used by database management systems to provide concurrent access to the database and in programming languages to implement transactional memory. Without concurrency control, if someone is reading from a database at the same time as someone else is writing to it, it is possible that the reader will see a half-written or inconsistent piece of data.

Optimistic concurrency control

Optimistic concurrency control (OCC), also known as optimistic locking, is a concurrency control method applied to transactional systems such as relational database management systems and software transactional memory. OCC assumes that multiple transactions can frequently complete without interfering with each other. While running, transactions use data resources without acquiring locks on those resources. Before committing, each transaction verifies that no other transaction has modified the data it has read.

Serialization

In computing, serialization (or serialisation) is the process of translating a data structure or object state into a format that can be stored (e.g. in secondary storage devices, data buffers in primary storage devices) or transmitted (e.g. data streams over computer networks) and reconstructed later (possibly in a different computer environment). When the resulting series of bits is reread according to the serialization format, it can be used to create a semantically identical clone of the original object.

Distributed concurrency control

Distributed concurrency control is the concurrency control of a system distributed over a computer network (Bernstein et al. 1987, Weikum and Vossen 2001). In database systems and transaction processing (transaction management) distributed concurrency control refers primarily to the concurrency control of a distributed database. It also refers to the concurrency control in a multidatabase (and other multi-transactional object) environment (e.g., federated database, grid computing, and cloud computing environments.

Schedule (computer science)

In the fields of databases and transaction processing (transaction management), a schedule (or history) of a system is an abstract model to describe execution of transactions running in the system. Often it is a list of operations (actions) ordered by time, performed by a set of transactions that are executed together in the system. If the order in time between certain operations is not determined by the system, then a partial order is used.

Transactional Memory: Hardware Simplification CS-307: Introduction to multiprocessor architecture

Explores transactional memory and hardware simplification for concurrency control in software, emphasizing the benefits of hardware speculation and declarative concurrency.

Transactional Memory: Hardware Simplification CS-307: Introduction to multiprocessor architecture

Explores hardware-based transactional memory for simplifying concurrency control and improving performance in hash tables.

Concurrency Control & Recovery in Databases CS-322: Introduction to database systems

Delves into transaction management, concurrency control, and recovery in databases to ensure data integrity and system resilience.

Scalable Synchronization Mechanisms for Manycore Operating Systems

Explores scalable synchronization mechanisms for many-core operating systems, focusing on the challenges of handling data growth and regressions in OS.

Transaction Management & Concurrency Control CS-322: Introduction to database systems

Explores transaction management, concurrency control, ACID properties, anomalies, and conflict serializability in database systems.