Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

OS 1/2

memorize.ai (lvl 286)

Section 1

Preview this deck

mutex lock vs binary semaphore

Front

1 / 24

iOS Dev Swift

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

1 year ago

Date created

Mar 14, 2020

Cards (24)

Section 1

(24 cards)

mutex lock vs binary semaphore

Front

Semaphore is a signalling mechanism, mutex is a locking mechanism. But they are both synchronization primitives and work almost the same.

Back

semaphore implementation

Front

Must guarantee that no two processes can execute the wait( ) and signal( ) on the same semaphore at the same time

Back

monitor

Front

synchronization construct that were created to overcome the problems caused by semaphores such as timing errors.

Back

cache memory

Front

located between cpu and ram, very fast

Back

Semaphore types

Front

binary, counting

Back

States of a process

Front

New Ready Waiting Running Terminated

Back

unbounded buffer

Front

places no practical limit on the size of the buffer

Back

Process vs Thread

Front

A process is an executing instance of an application. A thread is a path of execution within a process. a process can contain multiple threads. When you start an application, the operating system creates a process and begins executing the primary thread of that process.

Back

compaction (memory management)

Front

moving allocated objects together, and leaving empty space together

Back

bounded buffer

Front

(buffer of a fixed size) - consumer must wait if buffer is empty and consumer must wait if buffer is full.

Back

kernel mode

Front

An access mode for applications while they are running on the CPU that allows full access to all hardware devices and memory in the computer.

Back

livelock

Front

a condition where a thread is not blocked, but cannot move forward because an operation it continually retries fails

Back

Asynchronous threading

Front

Once the parent creates a child thread, it resumes operation. Children run independently, because the parent need not know when its child terminates.

Back

sequential access

Front

a retrieval method in which data must be accessed in the order in which it is stored

Back

foreground process

Front

started by the user

Back

Resource Starvation

Front

A condition where a computer process cannot be supported by available computer resources, e.g. due to the lack of computer resources or the existence of multiple processes that are competing for the same resources.

Back

operations that can be performed upon semaphores

Front

Back

random access

Front

describes a data structure or device in which all accesses have the same cost, O(1).

Back

pipe (operating systems)

Front

a pipe is a connection between two processes, such that the standard output from one process becomes the standard input of the other

Back

Binary Semaphore

Front

integer value is either 0 or 1

Back

race condition

Front

results when several threads try to access and modify the same data concurrently

Back

semaphore

Front

a variable or abstract data type used to control access to a common resource by multiple processes

Back

Counting Semaphore

Front

any integer value (used to count)

Back

what is a unit of work in the system?

Front

a process

Back