Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
A Concurrent data structure is a particular way of storing and organizing data for access by multiple computing threads (or processes) on a computer.
Course: Concurrent Data Structures, Monsoon 2020
Taught by: Prof. Govindarajulu Regeti
- Nonblocking k-compare-single-swap
- Concurrency in Distributed Systems, Leslie Lamport papers
- DDR, GDDR, HBM SDRAM Memory
- Dekker Algorithm
- Peterson Algorithm
- Bakery Algorithm
- Sleeping Barber Problem
- Dining Philosopher Problem
- Simple Semaphore
- Monitor Example
- Simple Reentrant Lock
- Simple Read Write Lock
- FIFO Read Write Lock
- TAS Lock
- TTAS Lock
- Backoff Lock
- Array Lock
- CLH Lock
- MCS Lock
- Bathroom Lock
- Savings Account
- Locked Queue
- Array Queue
- Array Stack
- Backoff Stack
- Elimination Backoff Stack
- Coarse Set
- Fine Set
- Optimistic Set
- The Art of Multiprocessor Programming by Maurice Herlihy, Nir Shavit
- The Art of Multiprocessor Programming: Concurrent Stacks and Elimination
- The Art of Multiprocessor Programming: Concurrent Hashing and Natural Parallelism
- The Art of Multiprocessor Programming: Skiplists and Balanced Search
- The Art of Multiprocessor Programming: Linked Lists: The Role of Locking
- The Art of Multiprocessor Programming: Monitors and Blocking Synchronization
- The Art of Multiprocessor Programming: Spin Locks and Contention
- Nonblocking k-compare-single-swap
- RISC-V offers simple, modular ISA
- Real-world Concurrency
- The Concurrency Challenge
- Data Structures in the Multicore Age
- Software and the Concurrency Revolution
- Turing Lecture - The Computer Science of Concurrency - The Early Years
- Solution of a Problem in Concurrent Programming Control
- High Bandwidth Memory
- Hybrid Memory Cube
- GDDR5 SDRAM
- GDDR4 SDRAM
- DDR4 SDRAM
- DDR3 SDRAM
- DDR SDRAM
- ECC memory
- Vector processor
Tip: Use Adobe Acrobat Reader DC to save PDF if highlighting is not visible on GitHub or other PDF viewers.