...
- First-come, first-served (FCFS)
- process customers in order of arrival
- most common queueing discipline
- e.g. linked list data structure where 0th element is always removed
- Last-come, first-served (LCFS)
- process most recent customer to have arrived
- could lead to starvation
- e.g. use of a stack via push and pop (brings back memories from x86 assembly, right?
)
- Round robin (RR)
- Poll from separate queues in a circular manner
- Processor sharing (PS)
- Time shared access to server
- All customers served simultaneously (but a little at a time)
- e.g. a CPU on a general purpose machine where the OS schedules tasks
- Random
- Priority
- Multiple classes of customers
- Some classes have higher or lower priority than others
- Higher priority customers receive "better" service
- Lower priority customers receive "worse" service
...