Concurrency

Table of contents

1. Java Memory Model
2. Threads
   1. Daemons
   2. Waiting for a thread to finish (Join)
   3. ThreadLocal
   4. Stale Caches
   5. Race Conditions
   6. Methods that should never be used.
3. Concurrent Data Classes
   1. Primitive Wrappers
   2. List
   3. Set
   4. Map
   5. Queue
   6. Exchanger
4. Classic Concurrency Control
   1. Volatile
   2. Synchronized
   3. Deadlocks
5. New Approach to Concurrency
   1. Executors and Schedulers
   2. Lock and ReentrantLock
   3. Latch
   4. CyclicBarrier
   5. Fork Join Framework
6. Cost of Concurrency
7. Miscellaneous

Java Memory Model

Threads

Image copied from: Theory: Operating Systems and Code Execution

Daemons

Waiting for a thread to finish (Join)

ThreadLocal

Stale Caches

Race Conditions

Methods that should never be used.

1. stop()
2. suspend()

Concurrent Data Classes

Primitive Wrappers

List

Set

Map

Queue

Exchanger

Classic Concurrency Control

Volatile

Synchronized

Deadlocks

New Approach to Concurrency

Executors and Schedulers

Lock and ReentrantLock

Latch

CyclicBarrier

Fork Join Framework

Cost of Concurrency

Cost of context switching

Miscellaneous

1. InterruptedException
2. Flow