Automated Meta-Control for Adaptable Real-Time Software

Real-Time Systems

Volumn 14, Issue 2, 1998, Pages 107-134

  Jehuda, Jair ^a   Israeli, Amos ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b NETANYA ACADEMIC COLLEGE   (Israel)

Author keywords

Approximate optimization; Binpack; Dynamic programming; Gradient greedy; Incremental algorithms; Knapsack; Monte Carlo analysis; Online adaptation; Real time software; Software meta control

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC PROGRAMMING; MONTE CARLO METHODS; ONLINE SYSTEMS; POLYNOMIALS; REAL TIME SYSTEMS;

ADAPTABLE REAL TIME SOFTWARE; ONLINE ADAPTATION; SOFTWARE META CONTROL;

COMPUTER SOFTWARE;

EID: 0032024534     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007907330985     Document Type: Article

References (17)

1. Agrawal, R. and Ezzat, A. 1985. Processor sharing in NEST: a network of computer workstations. 1st International Conference on Computer Workstations, pp. 198-208.
2. Bihari, T. and Schwan, K. 1988. A comparison of four adaptation algorithms for increasing the reliability of real-time software. Proceedings Ninth Real-Time Systems Symposium, pp. 232-243.
3. Douglis, F. and Ousterhout, J. 1991. Transparent process migration: Design alternatives and the sprite implementation. Software-Practice and Experience 21:757-785.
4. Garey, M. and Johnson, D. 1979 Computers and Intractability - Guide to the Theory of NP-Completeness. Bell Telephone Laboratories, Inc.
5. Gopinath, P. and Schwan, K. 1989. CHAOS: why one cannot have only an operating system for real-time applications. ACM Operating Systems Review 23:106-125.
6. Ibarra, O. and Kim, C. 1975. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM 22:463-468.
7. Jehuda, J. and Berry, D. 1995. A top layer design approach for adaptive real-time software. 20th IFAC/IFIP Workshop on Real Time Programming.
8. Jehuda, J. 1996. A Top Layer Design Approach to Complex Real-Time Systems. Submitted. PhD thesis, Department of Electrical Engineering, Israel Institute of Technology, Technion, Haifa, Israel.
9. Jehuda, J., Koren, G. and Berry, D. 1995. A time-sharing architecture for complex real-time systems. 1st International Conference on the Engineering of Complex Computer Systems.
10. Johnson, D., Demers, A., Ullmann, J., Garey, M. and Graham, R. 1974. Worst-case performance bounds for simple one dimensional packing algorithms. SIAM Journal of Computing 3:299-325.
11. Kenny, K. and Lin, K. 1991. Building flexible real-time systems using the Flex language. IEEE Computer 24:70-78.
12. Lawler, E. 1977. Fast approximation algorithms for knapsack problems. 18th Annual Symposium on Foundations of Computer Science, pp. 206-213.
13. Lantz, K., Theimer, M. and Cheriton, D. Preemptable remote execution facilities for the V-system. Proceedings of the ACM-SIGOPS 10th ACM Symposium on Operating System Principles, pp. 2-12.
14. Sahni, S. 1975. Approximatie algorithms for the 0/1 knapsack problem. Journal of the ACM 22:115-124.
15. Stankovic, J. and Ramamritham, K. 1989. The Spring kernel: A new paradigm for real-time operating systems. ACM Operating Systems Review 23:54-71.
16. Sha, L., Rugunathan, R., Lehoczky, J., and Ramamritham, K. 1989. Mode change protocols for priority-driven preemptive scheduling. Journal of Real-Time Systems 1:243-264.
17. Walker, B., Popek, G. and English, R. 1983. The LOCUS distributed operating system. Proceedings of the 9th ACM Symposium on Operating System Principles, pp. 49-70.