In computer science, an input queue is a collection of processes in storage that are waiting to be brought into memory to run a program.
Input queues are mainly used in Operating System Scheduling which is a technique for distributing resources among processes.
The purpose of scheduling is to ensure resources are being distributed fairly and effectively; therefore, it improves the performance of the system.
In term, its performance is not stable but better improves process waiting time than First-Come, First-Served.
Round-robin scheduling method will give a same amount of time for each process and cycle through them.
This method is heavily bases on a lot of time consuming to each process.
Multilevel queue scheduling is more complex compared to other methods, but it provides flexibility for OS to serve different response time requirements in complicated situations.
There are many different types of packet travelling around network core every day, and they are treated totally different.
The min fair-share means the network OS will distribute equally minimum resource for each type of packet.
The max fair-share means the network OS will provide more resource for packets that need to transfer large amount of date at that moment, but it will take the resource back after transferring.