Abstract
Computational characteristics of real-time expert systems have been the subject of research for more than a decade. The computation time required to complete inferences carried out by expert systems present high variability, which usually leads to severe under-utilization of resources when the design of the schedule of inferences is based on their worst computation times. Moreover, the event-based aperiodic activation of inferences increases the risk of transient overloads, as during critical conditions of the controlled or monitored environment the arrival rate of events increases. The dynamic scheduling algorithm presented in this article obtains statistical bounds of the time required to complete inferences on-line, and uses these bounds to schedule inferences achieving highly effective utilization of resources. In addition, this algorithm handles transient overloads using a robust approach. During overloads our algorithm completes nearly as many inferences as other dynamic scheduling algorithms, but shows significantly better effective utilization of resources.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barachini, F., “Frontiers in Run-Time Prediction for the Production-System Paradigm”, AI Magazine, Vol. 15, No. 3, pp. 47–61, Fall 1994.
Wang, R., H. and Mok, A. K., “Response-Time Bounds of Rule-Based Programs under Rule Priority Structure”, Proc. IEEE Real-Time Systems Symposium, pp. 142–151, 1994.
Cheng, A. M. K and Chen, J., “Response Time Analysis of OPS5 Production Systems”, IEEE Transactions on Knowledge and Data Engineering, Vol. 12, No. 3, pp. 391–498, May-Jun 2000.
Forgy, C. L., “On the Efficient Implementacion of Production Systems”, PhD Thesis, Carnegie-Mellon University, 1979.
Lenstra, J. K. and Rinnooy Kan, A. H. G., “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey”, Annals of Discrete Mathematics, Vol. 5, pp. 343–362, 1977.
George, L., Rivierre, N. and Spuri, M., “Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling”, Rapport de Reserche RR-2966, INRIA, Le Chesnay Cedex, France, 1996
Jeffay, K., Stanat, D. F. and Martel, C. U., “On Non-Preemptive Scheduling of Periodic and Sporadic Tasks with Varying Execution Priority”, Proc. IEEE Real-Time Systems Symposium, pp. 129–139, 1991.
George, L., Muhlethaler, P. and Rivierre, N., “Optimality and Non-Preemptive Scheduling Revisited”, Rapport de Reserche RR-2516, INRIA, Le Chesnay Cedex, France, 1995.
Locke, C. D., “Best Effort Decision Making for Real-Time Scheduling”, PhD Thesis, Carnegie-Mellon University, Computer Science Department, Pittsburgh, PA, 1986.
Butazzo, G., Hard Real-Time Computer Systems, Predictable Scheduling Algorithms and Applications, Chapter 8, Kluwer Academic Publishers, 1997. ISBN: 0-7923-9994-3.
Hardy, G., Littlewood, J. E. and Pólya, G., “Tchebychef’s Inequality”, Inequalities, Second Edition, Cambridge Mathematical Library, pp. 43–45 and 123, Feb. 1998. ISBN 0-521-35880-9.
Jensen, E., D., Locke, C. D. And Tokuda, H., “A Time-Driven Scheduling Model for Real-Time Operating Systems”, Proc. IEEE Real-Time Systems Symposium, pp. 112–122, 1985.
Gordon, A., The COM and COM+ Programming Primer, Prentice Hall, 2000. ISBN: 0130850322.
Shepherd, G., “COM Apartments”, Visual C++ Developers Journal, Vol. 2, N. 1, February/March 1999.
Gärdenfors, P., and Rott, H., “Belief Revision”, in Gabbay, D., Hogger, C. J. and Robinson, J. A., editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4, pp. 35–132. Clarendon Press, Oxford.
Baruah, S. K., Haritsa, J. and Sharma, N., “On-Line Scheduling to Maximize Task Completions”, Proc. IEEE Real-Time Systems Symposium, pp. 228–236, 1994.
Erlang, A. K., “The Theory of Probabilities and Telephone Conversations”, Nyt Tidsskrift for Matematik B, Vol. 20, 1909.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Campos, A.M., García, D.F. (2002). A Dynamic Scheduling Algorithm for Real-Time Expert Systems. In: Garijo, F.J., Riquelme, J.C., Toro, M. (eds) Advances in Artificial Intelligence — IBERAMIA 2002. IBERAMIA 2002. Lecture Notes in Computer Science(), vol 2527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36131-6_79
Download citation
DOI: https://doi.org/10.1007/3-540-36131-6_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00131-7
Online ISBN: 978-3-540-36131-2
eBook Packages: Springer Book Archive