An Optimal Value-Based Admission Policy and its Reflective Use in Real-Time Systems

Real-Time Systems

Volumn 16, Issue 1, 1999, Pages 5-30

  Bondavalli, Andrea ^a   Di Giandomenico, Felicita ^b   Mura, Ivan ^c  

^a ISTI CNR   (Italy)

^b CNR   (Italy)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Adaptive fault tolerance; Admission policy; Linear programming dependable systems; Performability maximisation; Value based resource assignment

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; CONSTRAINT THEORY; FAULT TOLERANT COMPUTER SYSTEMS; LINEAR PROGRAMMING;

ADMISSION POLICY; VALUE-BASED RESOURCE ASSIGNMENT;

REAL TIME SYSTEMS;

EID: 0032663004     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008089718353     Document Type: Article

References (31)

1. Arlat, J., Kanoun, K., and Laprie, J. C. 1990. Dependability modelling and evaluation of software fault-tolerant systems. IEEE Transactions on Computers 39: 540-513.
2. Baruah, S. K., and Haritsa, J. R. 1997. Scheduling for overload in real-time systems. IEEE Transactions on Computers 46: 1034-1039.
3. Baruah, S. K., Koren, G., Mao, D., et al. 1992. On the competitiveness of on-line real-time task scheduling. Real-Time Systems 4: 124-144.
4. Bestavros, A., and Nagy, S. 1996. Value-cognizant admission control for RTDB systems. IEEE Real Time Systems Symposium Washington, D.C., U.S.A.
5. Bondavalli, A., Chiaradonna, S., Di Giandomenico, F., et al. 1995. Dependability of Iterative Soflware: A Model for Evaluating the Effects of Input Correlation. Belgirate, Italy: SAFECOMP.
6. Burns, A., and Audsley, N. 1991. Scheduling hard real-time systems: A review. Software Engineering Journal 6: 116-128.
7. Buttazzo, G., and Stankovic, J. 1993. RED: Robust earliest deadline scheduling algorithm. International Workshop on Responsive Computing Systems Austin, USA.
8. Davis, A., Punnekkat, S., Audsley, N. C., et al. 1995. Flexible scheduling for adaptable real-time systems. IEEE Real-Time Technology and Applications Symposium Chicago, Illinois, U.S.A.
9. Kim, K., and Lawrence, T. 1992. Adaptive fault-tolerance in complex real-time distributed computer applications. Computer Communications 15.
10. Koren, G., and Shasha, D. 1995. Dover: An optimal on-line scheduling algorithm for overloaded real-time systems. SIAM Journal of Computing 24: 318-339.
11. Krantz, D. H., Luce, R. D., Suppes, P., et al. 1971. Foundations of Measurement: Additive and Polynomial Representations. Academic Press.
12. Laprie, J. C. 1995. Dependability - Its attributes, impairments and means. Predictably Dependable Computing Systems. Springer-Verlag, pp. 3-24.
13. Laprie, J. C., Arlat, J., Beounes, C., et al. 1990. Definition and analysis of hardware-and-software fault-tolerant architectures. IEEE Computer 23: 39-51.
14. Liu, C. L., and Layland, J. W. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20: 40-61.
15. Locke, C. D. (1986). Best-effort decision making for real-time scheduling. PhD. Thesis, CMU, USA.
16. Malek, M. 1995. Omniscience, consensus, autonomy: Three tempting roads to responsiveness. IEEE 14-th Symposium on Reliable Distributed Systems Bad Neuenahr, Germany, pp. xii-xiv.
17. Meyer, J. F. 1980. On evaluating the performability of degradable computing systems. IEEE Transactions on Computers C-29: 720-731.
18. Morton, T. E., and Pentico, D. W. 1993. Heuristic Scheduling Systems. New York: John Wiley.
19. Nassehi, M. M., and Tobagi, F. A. 1987. Transmission scheduling policies and their implementation in integrated-services local area networks. Fifth Annual European Fiber Optic Communications and Local Area Network Exposition Basel, Switzerland, pp. 185-192.
20. Papadimitriou, C. H. 1982. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall.
21. Ronen, Y., Mosse', D., and Pollack, M. E. 1996. Value-density algorithms for the deliberation-scheduling problem. SIGART Bulletin 7.
22. Saaty, T. L. 1992. Multiple Criteria Decision Making: The Analytic Hierarchy Process. RWS Publications.
23. Stankovic, J. 1991. On the reflective nature of the Spring kernel. Process Control Systems '91 Berlin, pp. 2-18, invited paper.
24. Stankovic, J., and Ramamrithan, K. 1995. A Reflective Architecture for Real-Time Operating Systems. Advances in Real-Time Systems. Prentice-Hall, pp. 23-38.
25. Suppes, P., Krantz, D. H., Luce, R. D., et al. 1989. Foundations of Measurement: Geometrical, Threshold and Probabilistic Representations. Academic Press.
26. Tai, A. T., Avizienis, A., and Meyer, J. F. 1992. Evaluation of fault-tolerant software: A performability modeling approach. Dependable Computing for Critical Applications 3. Springer-Verlag, pp. 113-135.
27. Tokuda, H., Wendorf, J. W., and Wang, H. Y. 1987. Implementation of a time-driven scheduler for real-time operating systems. IEEE Real-Time Systems Symposium.
28. Trivedi, K. S. 1982. Probability and Statistics with Reliability, Queuing and Computer Science Applications. Prentice-Hall.
29. Vincke, P. 1992. Multicriteria Decision-Aid. John Wiley and Sons.
30. Wang, W., Ramamrithan, K., and Stankovic, J. A. 1995. Determining redundancy levels for fault tolerant real-time systems. IEEE Transactions on Computers 29: 720-731.
31. Wendorf, J. W. 1988. Implementation and evaluation of a time-driven scheduling processor. IEEE Real-Time Systems Symposium.