| 摘要 |
A computer server and method for providing assured quality-of-service request scheduling in such a manner that low priority requests are not starved in the presence of higher priority requests. Each received data request is preferably assigned a priority having both a static priority component and a dynamic priority component. The static priority component is preferably determined according to a client priority, a requested resource priority, or both. The dynamic priority component is essentially an aging mechanism so that the priority of each request grows over time until serviced. Additionally, each assigned priority is preferably determined using a scaling factor which can be used to adjust a weighting of the static priority component relative to the dynamic priority component as necessary or desired for any specific application of the invention. |
