Abstract
Purchase PDF (263 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (411 K)
doi:10.1016/j.jss.2006.09.028 
Copyright © 2006 Elsevier Inc. All rights reserved.
Characterizing robustness in dynamic real-time systems
Available online 1 November 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The problem of robust task allocation is motivated by the need to deploy real-time systems in dynamic operational environments. Existing robust allocation approaches employ coarse robustness metrics, which can result in poor allocations. This paper proposes a metric that accurately characterizes a system’s robustness within feasible allocation regions. An allocation algorithm is provided to find allocations that are both feasible and robust; the robustness as measured by the metric is shown to have theoretical bounds. Experiments demonstrate that the algorithm produces good and scalable performance compared with several heuristic algorithms.
Keywords: Real-time system; Task allocation; Robustness; Dynamic environment
Article Outline
- 1. Introduction
- 2. System model
- 2.1. Traditional model
- 2.2. Model extensions
- 3. An accurate robustness metric
- 3.1. Previous metrics
- 3.2. Deficiencies
- 3.3. A new metric
- 3.4. Allocation problem
- 4. A robust allocation algorithm
- 5. Experiments
- 6. Conclusions
- Appendix A. Proofs for the theorems and corollaries given in Section 4
- Appendix B. An example
- References
