About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
CDC 1990
Conference paper
Optimality and finite time behavior of an adaptive multi-objective scheduling algorithm
Abstract
A multi-class M/GI/1 system is considered in which an average response time objective is associated with each class. The performance of each class is measured by the ratio of the average response time over the corresponding value of the objective. To achieve fairness in service allocation it is necessary to find a policy that lexicographically minimizes the vector of performance ratios arranged in non-increasing order. An adaptive policy is provided that only uses knowledge of arrival and departure instants and is easy to implement. Also considered is a variant of this policy which adapts faster to changes in the statistical parameters of the model. Both policies are analyzed via associated stochastic recursions using techniques of stochastic approximation.