A Barrier is a Synchronisation Primitive Used to Synchronise Multiple Threads at a Specific Point in Execution, Ensuring All Participating Threads Arrive Before Any are Allowed to Proceed

Condvar (Condition Variable) is a Synchronisation Primitive Used to Block a Thread Until a Particular Condition is Met, Working in Tandem With a Mutex to Enable Efficient Thread Signaling

MPMC (Multi-Producer, Multi-Consumer) is a Lock-Free, Bounded Queue Used to Safely Pass Data Between Multiple Threads via Atomic Memory Operations Without Relying on Mutexes

A Semaphore is a Synchronisation Primitive Used to Manage Access to a Shared Resource by Maintaining a Set of Permits, Allowing Multiple Threads to Access a Resource up to a Defined Limit

MPSC (Multi-Producer, Single-Consumer) is a Communication Primitive that Allows Multiple Threads to Send Data to a Single Receiver, Facilitating Safe Message Passing and Synchronisation

A Future is an Object that Acts as a Placeholder for a Result that is Initially Unknown Because the Computation is Not Yet Complete

RefCell is a Container that Provides Interior Mutability by Moving Borrow Checking Rules from Compile-Time to Runtime, Allowing for Multiple Immutable Borrows or a Single Mutable Borrow

Pin is a Wrapper That Ensures the Data it Points to Cannot be Moved in Memory, Protecting Self-Referential Pointers and Keeping Async Futures Safe

Cell is a Container that Provides Interior Mutability, Allowing you to Mutate Data Even When you Only Have an Immutable Reference to the Container

RWLock (Read-Write Lock) is a Synchronisation Primitive Used to Manage Access to a Shared Resource

A Box is a Smart Pointer That Allows You to Store Data on the Heap Instead of the Stack

A Reference Count (RC) is Used to Track How Many "owners" or Pointers Currently Refer to a Specific Resource-Such as an Object in Memory, a File on a Disk, or a Block of Data

An Atomic Reference Count (ARC) is a Memory Management Technique Used to Track How Many "owners" a Particular Object or Resource has in a Multi-Threaded Environment

A Mutex (Mutual Exclusion) is a Synchronisation Primitive Used to Prevent Multiple Threads from Accessing a Shared Resource at the Same Time

Last-In First-Out (LIFO) is a Sheduling Algorithm Where the CPU Processes the Most Recent Task to Arrive in the "Ready Queue" First, Prioritising the Newest Entry Over Older Ones

Copy-on-Write (CoW) is a Resource Management Technique Used to Efficiently Implement a "Duplicate" or "Copy" Operation on Modifiable Resources

First-In First-Out (FIFO) is a Scheduling Algorithm Where the CPU Processes Tasks in the Exact Order they Arrive in The "Ready Queue."

The Most Frequently Used (MFU) Algorithm is a Cache Replacement Policy (or Page Replacement Algorithm) Used in Operating Systems and Database Management Systems to Decide which Data Should be Disca…

Least Recently Used (LRU) is a popular algorithm used in computer memory management and caching to decide which data to discard when space runs out.

The Leaky Bucket is Used for Traffic Shaping or Rate Limiting

The Token Bucket is Used for Rate Limiting and Traffic Shaping

Duplicate Scans a Directory and Identifies Identical Files by Comparing their SHA-256 Hashes

An FNV (Fowler-Noll-Vo) Hash is a Non-Cryptographic Hash Function Designed for High Speed and a Low Collision Rate

Multilevel Feedback Queue (MLFQ) is a CPU Scheduling Algorithm that Improves upon a Standard MultiLevel Queue by Allowing Processes to Move Between Queues Based on Their Behaviour

Multilevel Queue (MLQ) Scheduling is an Operating System Strategy that Partitions the Ready Queue into Several Separate Queues Based on the Specific Characteristics of a Process

The Round Robin Scheduling Algorithm Chooses All Elements in a Group Equally in Some Rational Order

Shortest Job First (SJF) is a Scheduling Policy that Selects the Waiting Process with the Smallest Execution Time to Execute Next

The First-Come, First-Served (FCFS) Algorithm is an Operating System Scheduling Algorithm

The Weighted Scheduling Algorithm is a Method Used to Manage Multiple Tasks or Data Flows by Giving Them Different Levels of Priority or "weight"

The netcat Command is Used to Read and Write to Network Connections Using the TCP or UDP Protocol