Circular buffer
In computer science, a circular buffer, circular queue, cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end. This structure lends itself easily to buffering data streams. There were early circular buffer implementations in hardware.
Circular buffer - Wikipedia Jump to content From Wikipedia, the free encyclopedia Data structure in computer science A ring showing, conceptually, a circular buffer. This visually shows that the buffer has no real end and it can loop around the buffer. However, since memory is never physically created as a ring, a linear representation is generally used as is done below. In computer science , a circular buffer , circular queue , cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end. This structure lends itself easily to buffer
related reading
- Why the Ring Buffer is the Foundation of High-Performance Systems - DEV Communitydev.to
- Queue (abstract data type) - Wikipediaen.wikipedia.org
- A very concrete explanation of how a cache worksparksb.github.io
- What Every Programmer Should Know About Memorypeople.freebsd.org
- Buffer cache | CS 162 Project 3cs162.org
- Cache Lines - Algorithmicaen.algorithmica.org
- Linked list - Wikipediaen.wikipedia.org
- Girls Just Wanna Have Fast MPMC Queues with bounded waiting · Nahlanahla.dev
- How The Computer Works: The CPU and Memoryhomepage.cs.uri.edu
- priority_queue - C++ Referencecplusplus.com
- Elevator algorithmen.wikipedia.org
- LRU Cache: How It Works (Data Structure & Code) | Interview Cakeinterviewcake.com