Problem Using the General Cover Problem
BibTeX
@MISC{Cardei_problemusing,
author = {Mihaela Cardei and David Maccallum and Sai Chen and Ionut Cardei and Ding-zhu Du and Mihaela Cardei and David Maccallum and Sai Chen and Ionut Cardei and Ding-zhu Du},
title = {Problem Using the General Cover Problem},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Time-critical applications and multimedia systems require a mechanism to arbitrate access to shared resources. Resource Management systems provide the necessary services to applications for admission control and adaptation. This paper defines a model for the Resource Management Problem and describes two near-optimal approximation methods for criticality-based selection scheduling of competing applications. The resource management allocation scheme is designed to follow a set of goals. In this paper we focus on maximizing the number of higher-criticality sessions admitted, where a session is an instance of an application executing on a system, using a set of resources, such as CPU, memory and disk IO. First we reduce the Resource Management Problem to the General Cover Problem and then present two approximation solutions, one using a greedy algorithm with the performance ratio of 1 + ln(max1≤j≤n∑i=1,maij) and one using a linear programming algorithm with the performance ratio of max1≤i≤m∑j=1,naij. 1
Citations
| 6 | Criticality and QoS-Based Multiresource Negotiation - Huang, Wan, et al. - 1998 |
| 4 | X.: Design and Analysis of Approximation Algorithms - Du, Ko, et al. - 2008 |
| 2 | Rajkumar R, Siewiorek D. On quality of service optimization with discrete qos options - Lee, Lehoczky - 1998 |
