Page 1 |
Save page Remove page | Previous | 1 of 152 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
RESOURCE ALLOCATION IN DYNAMIC REAL-TIME SYSTEMS
by
Sethavidh Gertphol
A Dissertation Presented to the
FACULTY OF THE GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(ELECTRICAL ENGINEERING)
December 2006
Copyright 2006 Sethavidh Gertphol
Object Description
| Title | Resource allocation in dynamic real-time systems |
| Author | Gertphol, Sethavidh |
| Author email | gertphol@halcyon.usc.edu |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Electrical Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2005-12-07 |
| Date submitted | 2006 |
| Restricted until | Unrestricted |
| Date published | 2006-10-26 |
| Advisor (committee chair) | Prasanna, Viktor K. |
| Advisor (committee member) |
Raghavendra, Cauligi Zimmermann, Roger |
| Abstract | Dynamic real-time systems usually operate in an environment that is continuously changing.These changes in the environment cause workload of the system to vary during run time, and in effect causing system performance to fluctuate. In addition, certain Quality of Service (QoS) requirements are imposed on the real-time system and must be satisfied. Allocating system resource in this environment is challenging because a good and efficient allocation may become invalid when variations in workload cause Quality of Service violations.; This research examines the problem of initial resource allocation for a real-time system that operates in changing environment. An initial allocation is calculated before system starts up using expected values and variations that may happen during run time. In this research, resource allocation refers to the assigning of application tasks to processing nodes. The allocation should be "robust'' with respect to the variation in workload during run time. That is, the allocation should be able to "absorb'' the largest amount of workload variation, and thus delaying the instance that Quality of Service violation occurs.; A novel performance metric is proposed to evaluate the robustness of an initial allocation with respect to variations during run time. The problem of initially allocating system resources to maximize the proposed performance metric is then translated into a mathematical formulation. It should be noted that the resource allocation problem itself is non-linear, but can be linearized by two heuristics that are developed to remove non-linearity from the mathematical formulation of the problem. Three algorithms, all based on the well-researched linear programming approach, are developed to solve the mathematical problem. The first approach is fast, but cannot gaurantee the quality of resulting allocations. The second approach always finds an optimal solution, but is relatively slower than the first approach. In the third approach, tradeoff between the quality of results and execution time can be controlled through a user-provided parameter. Together with the two linearization heuristics, these three approaches provide a full spectrum of solutions for the initial resource allocation problem. |
| Keyword | resource allocation; robust; real-time systems |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Type | texts |
| Legacy record ID | usctheses-m112 |
| Rights | Gertphol, Sethavidh |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | http://www.usc.edu/isd/libraries/services/ask_a_librarian/email/ |
| Filename | etd-Gertphol-20061026 |
| Archival file | uscthesesreloadpub_Volume32/etd-Gertphol-20061026.pdf |
Description
| Title | Page 1 |
| Full text | RESOURCE ALLOCATION IN DYNAMIC REAL-TIME SYSTEMS by Sethavidh Gertphol A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (ELECTRICAL ENGINEERING) December 2006 Copyright 2006 Sethavidh Gertphol |
Comments
Post a Comment for Page 1
