Live briefing
Everything about Circular buffer
Data structure in computer science
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Circular bufferA 5-minute orientation
- Skim a recent paper: Influence of multiple structural parameters on buffer performance of a thin‐walled circular tube based on the coupling modeling techniqueInfluential work since 2022
- Pick up a classic book: Modern Operating SystemsThe most-reprinted book on the subject
- Read the landmark paper: Chaotic image encryption based on circular substitution box and key stream bufferCited 112 times
- Go sideways: Memory segmentationA closely related topic
- Go sideways: Sequence container (C++)A closely related topic
📖 Definitions
Noun A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.
🏆 Landmark papers (most cited)
Chaotic image encryption based on circular substitution box and key stream buffer
Circular Buffer Rate-Matched Polar Codes
Soil aggregates and associated carbon and nitrogen storage in circular grass buffer integrated cropping systems
Soil health responses of circular grass buffer strips in center‐pivot irrigated agriculture
Effects of seismic buffer thickness on a circular rock tunnel considering seismic damage form and failure state
Free Radical Generation in Far-UV Synchrotron Radiation Circular Dichroism Assays—Protein and Buffer Composition Contribution
Stress concentration at circular cutouts in buffer strip laminates
A Reverse-Encoding-Based On-Chip Bus Tracer for Efficient Circular-Buffer Utilization
🆕 Influential since 2022
Influence of multiple structural parameters on buffer performance of a thin‐walled circular tube based on the coupling modeling technique
Evaluating the potential of circular grass buffer strips to promote fungal community and soil health in water-limited agroecosystems
Ultrasonic imaging using a phased array probe with a buffer consisting of a bundle of circular cylinders
Evaluation of Circular Buffer and Service Area Buffer Methods in Accessibility Analysis of Trans Metro Bandung Route 1 Based on GIS
Effects of Native Grass Circular Buffer Strips on Native Bee Populations and Diversity in Pivot-Irrigated Corn
📚 Books worth reading
Modern Operating SystemsAndrew S. Tanenbaum, Herbert Bos · 1992
Fundamentals of data structures in CEllis Horowitz · 1993
Introduction to C ProgrammingReema Thareja · 2013- 📕Descriptive circular of the Westinghouse friction buffer (U.S. patent no. 391,997, issued October 39, 1888)Union Switch and Signal Company · 1890
- 📕[Broadside circulars from the firm of Taite & Carlton]Taite & Carlton (Firm)
Designing audio effect plug-ins in C++ with digital audio signal processing theoryWilliam C. Pirkle · 2013
Concurrent Euclid, The UNIX system, and TUNISR. C. Holt · 1983
Using Concurrency and Parallelism Effectively – IJon Kerridge · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Memory segmentation Memory segmentation is an operating system memory management technique of dividing a computer's primary memory into segments or sections. In a computer…
- Sequence container (C++) In C++, sequence containers or sequence collections refer to a group of container class templates in the standard library that implement storage of data…
- Log-structured file system A log-structured filesystem is a file system in which data and metadata are written sequentially to a circular buffer, called a log. The design was first…
- Double-ended queue Input Input Output Output as a queue as a stack In computer science, a double-ended queue (abbreviated as deque — /dɛk/ DEK), is an abstract data type…
- Queue (abstract data type) In computer science, a queue is an abstract data type that serves as an ordered collection of entities. By convention, the end of the queue where elements…
- Producer–consumer problem In computing, the producer-consumer problem (also known as the bounded-buffer problem) is a family of problems described by Edsger W. Dijkstra since 1965…
- Iterator pattern In object-oriented programming, the iterator pattern is a design pattern in which an iterator is used to traverse a container and access the container's…
- Dynamic array In computer science, a dynamic array, growable array, resizable array, dynamic table, mutable array, or array list is a random access, variable-size list…