Mutexes (Mutual exclusion)

Mutual exclusion

Mutual exclusion is a property of concurrency control that prevents race conditions by ensuring one thread of execution never enters a critical section while another concurrent thread is already accessing it. It requires that shared resources are only accessed by one thread at a time, preventing data inconsistency. Mutual exclusion was first identified and solved by Edsger W. Dijkstra in 1965 and is used to avoid race conditions when multiple threads access the same memory address.

3 courses cover this concept

CS 110: Principles of Computer Systems

Stanford University

Winter 2022

CS 110 delves into advanced computer systems and program construction, focusing on designing large systems, software that spans multiple machines, and parallel computing. This course builds upon CS107 and requires good knowledge of C, C++, Unix, GDB, Valgrind, and Make. It covers Linux filesystems, multiprocessing, threading, networking, and more.

No concepts data

+ 28 more concepts

CS 110: Principles of Computer Systems

Stanford University

Summer 2021

Requiring familiarity with C/C++ and Unix/Linux, delves into computer systems principles. Students will engage with a blend of C and C++ to interface with system resources and manage complex projects. The course covers a broad range of topics including filesystems, multiprocessing, synchronization, networking, and MapReduce.

No concepts data

+ 24 more concepts

CSCI 0300: Fundamentals of Computer Systems

Brown University

Spring 2023

Introductory course covering computer system fundamentals including machine organization, systems programming in C/C++, operating systems concepts, isolation, security, virtualization, concurrency, and distributed systems. Projects involve implementing core OS functionality.

No concepts data

+ 32 more concepts