• DocumentCode
    1662589
  • Title

    MIP formulation for robust resource allocation in dynamic real-time systems

  • Author

    Gertphol, Sethavidh ; Prasanna, Viktor K.

  • Author_Institution
    Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    2003
  • Abstract
    Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resources in this environment must be robust. Using the amount of load variation that the allocation can accommodate as a measure of robustness, we develop a mathematical formulation for the problem of robust resource allocation. Due to the complexity of the models used to represent the problem, the formulation is non-linear We propose a linearization technique based on variable substitution to reduce the mathematical formulation to a mixed integer programming formulation, called SMIP. Compared with existing techniques, the search space of SMIP is not restricted. Thus, if a feasible allocation exists, SMIP will always produce an optimal allocation.
  • Keywords
    computational complexity; integer programming; resource allocation; MIP formulation; SMIP; complexity; dynamic real-time systems; linearization technique; mathematical formulation; mixed integer programming formulation; optimal allocation; robust resource allocation; robustness; Degradation; Dynamic programming; Embedded system; Indium tin oxide; Linear programming; Linearization techniques; Load management; Real time systems; Resource management; Robustness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium, 2003. Proceedings. International
  • ISSN
    1530-2075
  • Print_ISBN
    0-7695-1926-1
  • Type

    conf

  • DOI
    10.1109/IPDPS.2003.1213231
  • Filename
    1213231