Concurrency design without traditional locks.

Multiple operations making progress together.

Techniques resolving detected deadlocks.

Arranging data at suitable address boundaries.

Concurrency design guaranteeing bounded progress.

Multiple operations executing simultaneously.

Code region requiring synchronized access.

Small unit transferred between memory and CPU cache.

Concurrency design guaranteeing progress without contention.

Coordinating concurrent operations.