Lecture

Scalable Synchronization Mechanisms for Manycore Operating Systems

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.

Description

This lecture by the instructor from Georgia Tech discusses the challenges of handling the increasing data growth and the regressions in operating systems. It covers the importance of synchronization mechanisms in many-core machines, the issues with current lock designs, and the need for scalable solutions. The lecture presents the instructor's contributions in designing scalable blocking locks, relaxed TLB coherence, and avoiding performance regressions. It also explores the impact of the instructor's research on evolving OS services for heterogeneous hardware and applications, emphasizing the critical role of lock algorithms in achieving high throughput and minimal memory footprint.

Official source

Ontological neighbourhood

Computer engineering

High-performance computing: Parallel computing

Related concepts (32)

Timestamp-based concurrency control

In computer science, a timestamp-based concurrency control algorithm is a non-lock concurrency control method. It is used in some databases to safely handle transactions, using timestamps. Every timestamp value is unique and accurately represents an instant in time. A higher-valued timestamp occurs later in time than a lower-valued timestamp. A number of different ways have been used to generate timestamp Use the value of the system's clock at the start of a transaction as the timestamp.

Concurrency control

In information technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency control ensures that correct results for concurrent operations are generated, while getting those results as quickly as possible. Computer systems, both software and hardware, consist of modules, or components. Each component is designed to operate correctly, i.e., to obey or to meet certain consistency rules.

Non-blocking algorithm

In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; for some operations, these algorithms provide a useful alternative to traditional blocking implementations. A non-blocking algorithm is lock-free if there is guaranteed system-wide progress, and wait-free if there is also guaranteed per-thread progress. "Non-blocking" was used as a synonym for "lock-free" in the literature until the introduction of obstruction-freedom in 2003.

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.

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.

Related lectures (64)

Lock-Free Synchronization: Practical Insights

Explores the significance of lock-free synchronization for achieving low latency in distributed systems and discusses practical solutions for unique identifier generation and messaging queues.

Concurrency Primitives and Pitfalls

Explores concurrency primitives, mutual exclusion, and synchronization pitfalls in operating systems, focusing on condition variables and semaphores.

Transactional Memory: Hardware Simplification

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

Transactional Memory: Two-phase Locking and Invisible Reads

Explores historical perspectives and mechanisms of transactional memory, emphasizing the importance and challenges of its implementation in modern computing systems.

Concurrency and Mutual Exclusion