Bounded queue
A bounded queue is a queue with a finite maximum capacity for stored items.
Python Concurrency with asyncio
A bounded queue is a queue configured with a finite maximum capacity for stored items.
- How it is used
- Controls producer pressure in asynchronous applications by defining what happens when a queue is full or empty.
- How deep it goes
- Explains capacity limits and contrasts nonblocking methods with coroutine methods, without detailing queue internals.
- Examples
- Uses a supermarket customer line and an asyncio.Queue(maxsize=1) code example.
- What you can do after
- Operate/configure it by setting Queue(maxsize) and choosing immediate or waiting insertion and retrieval methods.
Read how Python Concurrency with asyncio explains bounded queue →
Software Design for Python Programmers
A queue with a fixed maximum capacity that can become full when it contains that many values.
- How it is used
- Coordinates multiple producer and consumer threads around a shared, capacity-limited data container.
- How deep it goes
- Defines queue operations and condition-based synchronization, including waiting, reacquisition, rechecking, and notification.
- Examples
- Uses Python classes, two producers, three consumers, capacity eight, queue-state output, and zero end sentinels.
- What you can do after
- Build it from scratch using Python threading conditions to synchronize bounded producer-consumer workflows.
Read how Software Design for Python Programmers explains bounded queue →
Rust in Action: Systems programming concepts and techniques
A bounded queue is a queue with a fixed capacity that can make producers wait when no space is available.
- How it is used
- Uses channel-based task queues to apply back pressure when concurrent workers cannot consume work quickly enough.
- How deep it goes
- Defines capacity, memory, and producer-waiting trade-offs but does not show bounded-queue implementation code.
- Examples
- Contrasts bounded and unbounded channel behavior in a thread-pool task-queue setting.
- What you can do after
- Evaluate whether bounded or unbounded channel behavior fits a workload’s overload, memory, and waiting constraints.
Read how Rust in Action: Systems programming concepts and techniques explains bounded queue →
Related concepts
- queuekind of · A queue is an ordered collection that holds items for retrieval or processing, typically removing them in the order they were added.
- backpressureimplements · Backpressure is a flow-control mechanism in which downstream capacity constraints prompt upstream producers to slow, limit, pause, or reject work or data.
- clientused by · A client is a person, organization, device, or software component that receives or uses a product, service, resource, or functionality provided by another entity.
- producer-consumerused by · The producer-consumer model coordinates components that generate data with components that retrieve and process it, typically through a buffer or queue.
- producerused by · A producer is an entity or process that creates or supplies values, data, messages, events, or work for another entity to consume.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.