Skip to content

Latest commit

 

History

History
12 lines (7 loc) · 740 Bytes

README.md

File metadata and controls

12 lines (7 loc) · 740 Bytes

ELCRQ

Simulation of three process roundtrip scenario using ELCRQ. round-trip scenario

ELCRQ is a lockless block-when necessary queue based on LCRQ.

The block-when necessary behavior is so that the CPU is free to other things when the queue is empty. The main aim is to save power when the queue is empty. This is implemented using Event-Counts.

Check implementation folders (c/c++) for build instructions.

Please prefer C++ for your implementation. The C library which I use for runtime shared memory allocation is unstable. It is only present as a proof of concept.