Queueing Theory

Internal

• Reactive Programming
• Universal Scalability Law
• Go Pipelines

TODO

TODO: 2018.07.20 - The Essential Guide to Queueing Theory.pdf in Learning.

Queueing in Pipelines

This section discusses queueing for pipelines. A pipeline consists in a series of stages, which process a stream of data. Without buffers (queues) between stages, a slow stage will block the upstream stages from working. This is because a slow stage is unable to process a new stream element, making the upstream stage unable to hand over the stream element, thus blocking it. The delay will propagate upstream, possibly all the way to the pipeline input, preventing new stream elements to be processed altogether.

Decoupling stages.