GF.Queuing

	GF	Queuing	Version:	0.2
	Document type:	Generic Function	Owner:	Mischa Frenk

Description

This Generic Function belongs to Working Area Network. Function to optimise resources usage or traffic based on various scheduling policies. Examples of scheduling policies can be:

• First in first out

This principle states that customers are served one at a time and that the customer that has been waiting the longest is served first.

• Last in first out

This principle also serves customers one at a time, however the customer with the shortest waiting time will be served first. Also known as a stack.

• Processor sharing

Service capacity is shared equally between customers.[16]

• Priority

Customers with high priority are served first. Priority queues can be of two types, non-pre-emptive (where a job in service cannot be interrupted) and pre-emptive (where a job in service can be interrupted by a higher priority job). No work is lost in either model.

• Shortest job first

The next job to be served is the one with the smallest size

• Pre-emptive shortest job first

The next job to be served is the one with the original smallest size

• Shortest remaining processing time

The next job to serve is the one with the smallest remaining processing requirement.

Icon

The image "Icon" (shown below) can be used to represent this infrastructure function in graphical Pattern representations that it might be part of:

Icon for this function

Icon for this function

Generic Patterns using this Generic Function

The following Generic Patterns use this function:

Semantic query

Applied Pattern	Owner	Maturity
Access Distribution	J.A.H. Schoonderbeek	3

Applied versions of this Generic Function

The following variants of this function have been defined:

Semantic query

No Applied Pattern based on this Generic Pattern (yet)