Approximation Solutions for the Resource Management Problem Using the General Cover Problem

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 Problemand 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 thenpresent two approximation solutions with their performance ratio. First solution uses a greedy algorithm and the second one a linear programming algorithm.