Fair queue algorithm for sharing resources among disparate prioritized groups, yet providing optimal overall utilization level
Original Publication Date: 2004-Sep-07
Included in the Prior Art Database: 2004-Sep-07
The queue algorithm presented here guarantees optimal usage of overall resources while complying with the priority policy set by management.. Each group is guaranteed to get its resources when it needs them. However, if the resources are not used by their "owners", then others are allowed to use them. The algorithm also ensures that, over time, one cannot "hog" the system and take more than one's fair share of the resources.