Call stack
A call stack is the stack data structure a program's runtime uses to track active function calls, pushing a frame for each call and producing stack traces and stack overflow errors.
Circular buffer
A circular buffer, also called a ring buffer or cyclic buffer, is a data structure with a fixed-size buffer whose end wraps to its beginning, so data streams through a fixed allocation indefinitely.
Data buffer
A data buffer, also called packet buffering or buffer memory, is a region of memory holding data temporarily while it moves, bridging speed and timing differences.
Double-ended queue
A double-ended queue, abbreviated deque, is a data structure in which elements can be added, removed, and examined at both the front and the back.
FIFO (computing)
FIFO, first-in-first-out, is a queue discipline in which the first item added is the first removed, used in router buffers, CPU scheduling, and concurrent queues.
Message queue
A message queue is a named destination in a messaging system where messages sent by one program accumulate in storage until another program retrieves and processes them, letting the programs run at different speeds and times.
Priority queue
A priority queue is an abstract data type that stores items each with a priority and efficiently removes the highest-priority item, usually implemented as a binary heap and used in Dijkstra's algorithm and scheduling.
Queue (abstract data type)
A queue is an abstract data type that stores items in first-in, first-out order, adding them at the rear with enqueue and removing them from the front with dequeue.
Stack (abstract data type)
A stack, also called a push-down store, is an abstract data type where only the most recently added item may be removed, following last-in, first-out order.