# fast_ring_queue

**Repository Path**: ydong08/fast_ring_queue

## Basic Information

- **Project Name**: fast_ring_queue
- **Description**: A fast no_lock RingQueue between 2 threads (25M WrtieRead per second)
- **Primary Language**: C
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 1
- **Created**: 2021-05-12
- **Last Updated**: 2024-01-31

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

## 1. What is a ring queue
--------------

* the data is "first in first out".
* prev data of queue head is the queue tail.
* the data of ring can reuse.


## 2. The advantages of ring queue
--------------

* Guaranteed elements are first-in, first-out

* Element space can be reused

* Provides an efficient mechanism for multithread data transfer.


## 3. Ring queue of work example
--------------

* Linux between kernel and system to transfor network data( PACKET_RX_RING and PACKET_TX_RING )


## 4. Actual test results
--------------

* In CentOS 5.5 (cpu per core frequency 1200MHz) . 
* ring queue length is 10000, one element data size is 4 bytes
* [ring_test] the element writted and then to read is about 25 million per second.
* [notify_ring_test] the element writted and then to read is about 20 million per second.