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

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.

[1]  R. Bellman,et al.  Linear Programming and Economic Analysis. , 1958 .

[2]  Edward A. Lee,et al.  Dataflow process networks , 2001 .

[3]  Kang G. Shin,et al.  Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems , 1997, IEEE Trans. Software Eng..

[4]  Luciano Lavagno,et al.  A case study in embedded system design: an engine control unit , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[5]  Viktor K. Prasanna,et al.  A metric and mixed-integer-programming-based approach for resource allocation in dynamic real-time systems , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[6]  C. Siva Ram Murthy,et al.  Task Allocation Algorithms for Maximizing Reliability of Distributed Computing Systems , 1997, IEEE Trans. Computers.

[7]  Viktor K. Prasanna,et al.  Greedy Heuristics for Resource Allocation in Dynamic Distributed Real-Time Heterogeneous Computing Systems , 2002, PDPTA.

[8]  Daniel P. Siewiorek,et al.  Practical solutions for QoS-based resource allocation problems , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[9]  Binoy Ravindran,et al.  Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems , 2002, IEEE Trans. Computers.

[10]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[11]  Ricardo Cayssials,et al.  A Heuristic Approach to the Multitask-Multiprocessor Assignment Problem using the Empty-Slots Method and Rate Monotonic Scheduling , 1997, Real-Time Systems.

[12]  Howard Jay Siegel,et al.  Task execution time modeling for heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).