This project implements the Michael-Scott lock-free queue algorithm with hazard pointers for safe memory reclamation. The implementation is written in C++ and includes comprehensive tests and demos.

Abstract: Internet congestion algorithm decides the queue sizes and quality of service (QoS) of network. Based on the mechanism of Internet congestion control, a new active queue management (AQM) ...

Abstract: The class of Join-Idle-Queue load balancing algorithms was designed for Cloud service data centers. These algorithms have low overhead and achieve high performance for low to medium loads.

A queue is a first-in-first-out (FIFO) data structure. A stack is a last-in-first-out (LIFO) data structure. Here is a simple illustration: Both of these data structures are usually implemented using ...