Automated Meta-Control for Adaptable Real-Time Software

作者: Jair Jehuda , Amos Israeli

DOI: 10.1023/A:1007907330985

关键词: Aggregate (data warehouse)Dynamic programmingRange (mathematics)Monte Carlo methodSoftwareKnapsack problemApproximation algorithmSoftware configuration managementComputer scienceReal-time computing

摘要: The software meta-controller is an online agent responsible for dynamically adapting application‘s configuration, e.g. altering operational modes and migrating tasks, to best accommodate varying runtime circumstances. In distributed real-time applications such adaptations must be carried out in a manner which maintains the schedulability of all critical tasks while maximizing some notion system value other tasks. For large-scale applications, considering possible at task-level computationally intractable. This paper presents automated aggregate approach meta-control, appropriate systems. meta-control problem still NP-hard, but it has very practical approximate solutions. Introduced, here, are two very-effective approximation algorithms, QDP GG, with reasonable polynomial time complexity. Both algorithms also provide us upper bounds optimum values, useful deriving absolute, albeit somewhat pessimistic, measures actual performance. Extensive Monte Carlo analysis used illustrate that expected performance both generally suboptimal by no more than few percent. Our flexible model shown readily applied wide range time-sensitive applications.

参考文章(16)
E. L. Lawler, Fast approximation algorithms for knapsack problems 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). pp. 206- 213 ,(1977) , 10.1109/SFCS.1977.11
Lui Sha, Ragunathan Rajkumar, John Lehoczky, Krithi Ramamritham, Mode Change Protocols for Priority-Driven Preemptive Scheduling Real-time Systems. ,vol. 1, pp. 243- 264 ,(1989) , 10.1007/BF00365439
Oscar H. Ibarra, Chul E. Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems Journal of the ACM. ,vol. 22, pp. 463- 468 ,(1975) , 10.1145/321906.321909
D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, R. L. Graham, Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms SIAM Journal on Computing. ,vol. 3, pp. 299- 325 ,(1974) , 10.1137/0203025
John A. Stankovic, Krithi Ramamritham, None, The Spring kernel: a new paradigm for real-time operating systems Operating Systems Review. ,vol. 23, pp. 54- 71 ,(1989) , 10.1145/71021.71024
Marvin M. Theimer, Keith A. Lantz, David R. Cheriton, Preemptable remote execution facilities for the V-system symposium on operating systems principles. ,vol. 19, pp. 2- 12 ,(1985) , 10.1145/323627.323629
Bruce Walker, Gerald Popek, Robert English, Charles Kline, Greg Thiel, The LOCUS distributed operating system symposium on operating systems principles. ,vol. 17, pp. 49- 70 ,(1983) , 10.1145/773379.806615
P. Gopinath, K. Schwan, CHAOS: why one cannot have only an operating system for real-time applications Operating Systems Review. ,vol. 23, pp. 106- 125 ,(1989) , 10.1145/71021.71027