GF.Queuing: Difference between revisions
Jump to navigation
Jump to search
m (Jan Schoonderbeek moved page GF.Priority Queuing to GF.Queuing without leaving a redirect: rename) |
(promoted to maturity 2 + small layout improvement) |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{Maturity| | {{Maturity|2}} | ||
{{Pageheaderbox4GF | {{Pageheaderbox4GF | ||
|name=Queuing | |name=Queuing | ||
|WorkingArea=Network | |WorkingArea=Network | ||
|version=0. | |version=0.4 | ||
|owner=Mischa Frenk | |owner=Mischa Frenk | ||
|summary=Provides the ability to process traffic based various | |summary=Provides the ability to process traffic based various queuing policies. | ||
}} | }} | ||
Function to optimise | This Function serves to optimise processing of traffic or resource usage, based on one or more queuing policies. A queuing policy formulates a decision on which job to perform next, where "job" can mean an action, processing task, data packet transfer et cetera. Queuing policies generally can occur in two different forms: | ||
* non-pre-emptive: in this form a job being processed cannot be interrupted; the queuing function simply decides on the next job in line; | |||
* First in first out | * pre-emptive: in this form an active job can be interrupted as soon as another non-active job takes precedence according to the queuing policy. The active job is deactivated (usually without losing the results of the processing thusfar), and the higher precedence job starts processing. | ||
This | To be able to prioritize jobs, Queuing must be paired with Caching, which then serves as the buffer for jobs that cannot be processed yet. | ||
* Last in first out | |||
This | Examples of queuing policies are: | ||
* | * First in first out:<br>This policy states that the job that has been waiting the longest is served first. | ||
Service capacity is shared equally | * Last in first out:<br>This policy states that the job that was added most recently will be served first. | ||
* Priority | * Resource sharing:<br>Service capacity is shared equally over multiple jobs. | ||
* Priority:<br>A job with an assigned priority that is higher than that of another job is served first. This ofcourse means a priority criterium must be available, e.g. based on metadata. | |||
* Shortest job first | * Shortest job first:<br>The next job to be served is the one with the smallest size or shortest expected duration. | ||
The next job to be served is the one with the smallest size | * Pre-emptive shortest job first: | ||
* Pre-emptive shortest job first | The next job to be served is the one with the smallest size or shortest expected duration; if a new job comes in with smaller size or expected duration than the remaining size/duration of the currently running job, the running job is interrupted. | ||
The next job to be served is the one with the | |||
{{FunctionIcon | {{FunctionIcon | ||
|image=Icon | |image=Icon GF Queuing.png | ||
}} | }} | ||
{{Text Footer GF}} | {{Text Footer GF}} | ||
Latest revision as of 07:28, 6 January 2015
 | Page maturity This page has maturity level 2 (young) |
|
GF | Queuing | Version: | 0.4 | 
|
|---|---|---|---|---|---|
| Document type: | Generic Function | Owner: |
 | Provides the ability to process traffic based various queuing policies. |
Description
This Generic Function belongs to Working Area Network. This Function serves to optimise processing of traffic or resource usage, based on one or more queuing policies. A queuing policy formulates a decision on which job to perform next, where "job" can mean an action, processing task, data packet transfer et cetera. Queuing policies generally can occur in two different forms:
- non-pre-emptive: in this form a job being processed cannot be interrupted; the queuing function simply decides on the next job in line;
- pre-emptive: in this form an active job can be interrupted as soon as another non-active job takes precedence according to the queuing policy. The active job is deactivated (usually without losing the results of the processing thusfar), and the higher precedence job starts processing.
To be able to prioritize jobs, Queuing must be paired with Caching, which then serves as the buffer for jobs that cannot be processed yet.
Examples of queuing policies are:
- First in first out:
This policy states that the job that has been waiting the longest is served first. - Last in first out:
This policy states that the job that was added most recently will be served first. - Resource sharing:
Service capacity is shared equally over multiple jobs. - Priority:
A job with an assigned priority that is higher than that of another job is served first. This ofcourse means a priority criterium must be available, e.g. based on metadata. - Shortest job first:
The next job to be served is the one with the smallest size or shortest expected duration. - Pre-emptive shortest job first:
The next job to be served is the one with the smallest size or shortest expected duration; if a new job comes in with smaller size or expected duration than the remaining size/duration of the currently running job, the running job is interrupted.
Icon
The image "Icon GF Queuing.png" (shown below) can be used to represent this infrastructure function in graphical Pattern representations that it might be part of:
Generic Patterns using this Generic Function
The following Generic Patterns use this function:
| 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:
No Applied Pattern based on this Generic Pattern (yet)
