Heuristic resource allocation algorithms for maximizing allowable workload in dynamic, distributed real-time systems

Summary form only given. We examine several heuristic algorithms for the maximum allowable workload (MAW) problem for real-time systems with tasks having variable workloads. Briefly, the problem concerns the allocation of tasks to m processors, where each task t is characterized by a function t.r(w) that gives the running time of the task in terms of its workload (or input size) w. The objective of the maximum allowable workload problem is to find an allocation of tasks to processors so that the allocation is feasible (no task misses its deadline) when each task is given a workload of w or smaller and w is maximized. This optimization problem uses a robustness measure that is closely related to the MAIL (maximum allowable increase in load) metric recently proposed by Gertphol et al. The main contribution of this paper is the comparison of several heuristic algorithms for the MAW-RMS problem. Hillclimbing, random search, simulated annealing, and first-fit heuristics are presented and evaluated via simulation. As we show here, the first-fit greedy heuristic produces solutions of a reasonable quality compared to the other algorithms. In addition, we demonstrate the applicability of our model in air defense systems.

[1]  Frode Eika Sandnes,et al.  A hybrid genetic algorithm applied to automatic parallel controller code generation , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Dong-Ik Oh,et al.  Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment , 1998, Real-Time Systems.

[4]  Daniel P. Siewiorek,et al.  A resource allocation model for QoS management , 1997, Proceedings Real-Time Systems Symposium.

[5]  Chen Lee,et al.  An Approach for Quality of Service Management , 1998 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[8]  Daniel P. Siewiorek,et al.  On quality of service optimization with discrete QoS options , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

[9]  Emile H. L. Aarts,et al.  4. Simulated annealing , 2003 .

[10]  Paolo Palazzari,et al.  A new method for optimization of allocation and scheduling in real time applications , 1995, Proceedings Seventh Euromicro Workshop on Real-Time Systems.

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

[12]  Yongjun Zhou.  Execution time analysis for dynamic real-time systems , 2002 .

[13]  Kang G. Shin,et al.  Combined Task and Message Scheduling in Distributed Real-Time Systems , 1999, IEEE Trans. Parallel Distributed Syst..

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

[15]  Alan Burns,et al.  Allocating hard real-time tasks: An NP-Hard problem made easy , 1992, Real-Time Systems.

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Kang G. Shin,et al.  Optimal combined task and message scheduling in distributed real-time systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[18]  Lonnie R. Welch,et al.  A dynamic real-time benchmark for assessment of QoS and resource management technology , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

[19]  John A. Stankovic,et al.  Applicability of simulated annealing methods to real-time scheduling and jitter control , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[20]  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.