Method for Graph-based Real-time Rule Scheduling in Multi-core Environment

被引:0
作者
Wang J.-J. [1 ,2 ]
Qiao Y. [1 ]
Xiong J.-Q. [3 ]
Wang H.-A. [1 ]
机构
[1] Institute of Software, The Chinese Academy of Sciences, Beijing
[2] University of Chinese Academy of Sciences, Beijing
[3] Department of Mathematics and Computer Science, Nanchang Normal University, Nanchang
来源
Ruan Jian Xue Bao/Journal of Software | 2019年 / 30卷 / 02期
基金
中国国家自然科学基金;
关键词
Multi-core; Real-time reasoning; Rule reasoning; Rule scheduling; Safety-critical;
D O I
10.13328/j.cnki.jos.005312
中图分类号
学科分类号
摘要
Safety-critical systems detect external events, match the targeted event patterns, and give timely responding actions; otherwise catastrophic results will be incurred. With the increasing demand for intelligence in the safety-critical systems, applying rule-based reasoning to these systems has become an inevitable trend. Besides, rule scheduling is the key to assure hard real-time constraints within rule-based reasoning solutions. In this study, a solution to the multi-core rule scheduling problem, named GBRRS (graph-based real-time rule scheduling), was proposed. With the real-time rule reasoning process analyzed, how rules in safety-critical systems can be modeled as tasks using the graph mapping is described first, and the graph-based end-to-end reasoning task model, E2ERTG, is proposed. Then, a multi-core scheduling algorithm, GBRRS, is presented to guarantee each rule's deadline via the control of the reasoning task's deadline. Simulation-based experiments have been conducted to evaluate the performance of GBRRS. The result shows that GBRRS remains a rule success ratio above 80% even with relatively high workload of the rule set and is superior to DM-EDF by average 13%~15% in terms of rule success ratio. © Copyright 2019, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:481 / 494
页数:13
相关论文
共 22 条
[1]  
John C., Safety critical system: Challenges and directions, Proc. of the 24th Int'l Conf. on Software Engineering, pp. 547-550, (2002)
[2]  
Dean T., Boddy M., An analysis of time-dependent planning, Proc. of the 7th National Conf. on Artificial Intelligence, pp. 49-54, (1988)
[3]  
Garvey A., Lesser V., Design-to-time real-time scheduling, IEEE Trans. on Systems Man & Cybernetics, 23, 6, pp. 1491-1502, (1996)
[4]  
Lesser V., Pavlin J., Durfee E., Approximate processing in real-time problem solving, AI Magazine, 9, 1, pp. 49-61, (1988)
[5]  
Mouaddib A., Charpillet F., Haton J., GREAT: A model of progressive reasoning for real-time systems, Proc. of the 6th Int'l Conf. on Tools with Artificial Intelligence, pp. 521-527, (1994)
[6]  
Kang J., Cheng A., Shortening matching time in OPS5 production systems, IEEE Trans. on Software Engineering, 30, 7, pp. 448-457, (2004)
[7]  
Cheng A., Fujii S., Self-stabilizing real-time OPS5 production systems, IEEE Trans. on Knowledge and Data Engineering, 16, 12, pp. 1543-1554, (2004)
[8]  
Li X., Qiao Y., Wang H.A., A flexible event-condition-action rule processing mechanism based on a dynamically reconfigurable structure, Proc. of the 11th Int'l Conf. on Enterprise Information Systems, pp. 328-329, (2009)
[9]  
Li X., Qiao Y., Li X., Wang H.A., Real-time ECA rule reasoning in active database, Journal of Computer Research and Development, 47, 1, pp. 250-258, (2010)
[10]  
Li N., Qiang G., Deadline-aware event scheduling for complex event processing systems, Proc. of the 14th Int'l Conf. on Intelligent Data Engineering and Automated Learning, pp. 101-109, (2013)