Texonom
Texonom
/
Computing
Computing
/Computing Theory/
Queueing theory
Search

Queueing theory

Creator
Creator
Seonglae Cho
Created
Created
2023 Sep 20 7:18
Editor
Editor
Seonglae Cho
Edited
Edited
2024 Jan 9 1:41
Refs
Refs
Queue
Tetris Algorithm

Scheduling

Queueing theory notion
FIFO Algorithm
Round Robin
Interval scheduling
Interval partitioning
Minimize lateness scheduling
WFQ
 
 
 
 
Scheduling (computing)
In computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The tasks may be threads, processes or data flows.
Scheduling (computing)
https://en.wikipedia.org/wiki/Scheduling_(computing)
Queueing theory
Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted. Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service.
Queueing theory
https://en.wikipedia.org/wiki/Queueing_theory
Queueing theory
 
 

Recommendations

Texonom
Texonom
/
Computing
Computing
/Computing Theory/
Queueing theory
Copyright Seonglae Cho