Approximation Solutions for the Resource Management Problem Using the General Cover Problem
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Approximation Solutions for the Resource Management Problem Using the General Cover Problem
Published Date
2001-12-13
Publisher
Type
Report
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.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Cardei, Mihaela; MacCallum, David; Chen, Sai; Cardei, Ionut; Du, Ding-Zhu. (2001). Approximation Solutions for the Resource Management Problem Using the General Cover Problem. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215497.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.