A user-perceived rule request scheduling algorithm in rule engine system

A novel rule request scheduling algorithm was proposed for the rule base server. The basic idea is that based on service queues classified by request classification function, the algorithm maximize the weighted values of “value rate” and system response time to reflect the performance of rule-based server and use it as the scheduling optimization objective. In addition, this algorithm uses adaptive coefficients dynamic adjustment mechanism to prevent the occurrence of “hunger”. The experimental results show that in considering the “value rate” of rules, the performance of URRS always outperforms other user-based algorithm such as APSP scheduling algorithm and it can flexible control the degree of “hunger” by regulating the value of C₀ in scheduling formula.