Queueing Theory: Difference between revisions
Jump to navigation
Jump to search
| Line 3: | Line 3: | ||
* [[Reactive Programming]] | * [[Reactive Programming]] | ||
* [[Universal Scalability Law]] | * [[Universal Scalability Law]] | ||
* [[Go_Pipelines#Stage_Queueing|Go Pipelines]] | |||
=TODO= | =TODO= | ||
<font color=darkkhaki>TODO: 2018.07.20 - The Essential Guide to Queueing Theory.pdf in Learning.</font> | <font color=darkkhaki>TODO: 2018.07.20 - The Essential Guide to Queueing Theory.pdf in Learning.</font> | ||
Revision as of 17:52, 7 February 2024
Internal
TODO
TODO: 2018.07.20 - The Essential Guide to Queueing Theory.pdf in Learning.
Overview
Queueing in Pipelines
This section discusses queueing for pipelines. A pipeline consists in a series of stages, which process a stream of data.