Article navigation

Applies a parallel backward‐chaining technique to a rule‐based expert system on a shared‐memory multiprocessor system. The condition for a processor to split up its search tree (task‐node) and generate new OR nodes is based on the level in the goal tree at which the task‐node is found. The results indicate satisfactory speed‐up performance for a small number of processors (< 10) and a reasonably large number of rules.

This content is only available via PDF.
You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Pay-Per-View Access
$41.00
Rental

or Create an Account

Close subscription notice
Close access options