Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A FAST, PARTIALLY PARALLELIZABLE ALGORITHM FOR PREDICTING EXECUTION TIME OF EQL RULEBASED
 

Summary: A FAST, PARTIALLY PARALLELIZABLE ALGORITHM FOR
PREDICTING EXECUTION TIME OF EQL RULE­BASED
PROGRAMS \Lambda
Jeng­Rung Chen and Albert Mo Kim Cheng
Department of Computer Science
University of Houston
Houston, TX 77204­3475
E­mail:cheng@cs.uh.edu
Abstract -- Real­time expert systems are embedded
decision systems which must respond to changes in the
environments within stringent timing constraints. A
major problem impeding the use of rule­based expert
systems in real­time environments is the difficulty in
predicting the response time of these rule­based sys­
tems. In this paper, we tackle this problem with a
fast, partially parallelizable response time analysis al­
gorithm for a class of EQL rule­based programs with
constant assignments in the action parts of the rules.
1 INTRODUCTION
Given a program p, the response time analysis prob­

  

Source: Azevedo, Ricardo - Department of Biology and Biochemistry, University of Houston

 

Collections: Biology and Medicine; Environmental Sciences and Ecology