3 ms·
How is the concept of algorithmic complexity analogous to queuing?
by unification_fan 2y ago
How is the concept of algorithmic complexity analogous to queuing?
- amw-zero 2y agoYour whole system is a queue. Requests come in, are processed, and some output is given. Algorithmic complexity affects the processing time of each request / task. Knowing the latency distribution is crucial in understanding the queueing characteristics of the system, and the algorithmic complexity will greatly affect that distribution.