Parallel and Distributed Processing Symposium, International (2001)
San Francisco, California, USA
Apr. 23, 2001 to Apr. 27, 2001
Resource allocation policies which significantly Improve Quality of Service (QoS) while minimizing QoS instability are presented. In a dynamic system in which applications are continuously entering and departing the system, QoS instability occurs when the system over-commits resources and can not meet the resource demands of new admission requests. The system is forced to either reject the request or degrade one or more existing tasks. In this paper we introduce three admission control policies and compare their QoS performance/stability tradeoffs. We show that by maintaining a small resource reserve modeled as a competing application in the QoS optimization framework, we can achieve QoS levels that are over 90% of the theoretical maximum while reducing instability by one to two orders of magnitude.
J. P. hansen, J. Lehoczky and R. Rajkumar, "Optimization of Quality of Service in Dynamic Systems," Parallel and Distributed Processing Symposium, International(IPDPS), San Francisco, California, USA, 2001, pp. 30095b.