Performance of OPS5 matching on CUPID

https://doi.org/10.1016/0165-6074(89)90081-1Get rights and content

Abstract

CUPID is a multiprocessor architecture which runs the DRete matching algorithm. This paper describes the performance of the DRete/CUPID combination in executing OPS5 matching. Results from simulations and analysis are presented. They show that the DRete/CUPID combination is effective at extracting parallelism from the match operation and can execute the resulting parallel process efficiently. The amount of parallelism extracted from the programs studied ranges from 5.5 for the smallest to 21.8 for the largest.

A standard cell design of the CUPID processing element has been done. Timing information from this design is incorporated into the simulator. Measurements indicate that the overall speedup obtained with the DRete/CUPID combination ranges from 22.9 to 53.6 over a VAX 11/785 running compiled versions of the same programs. The analysis presented demonstrates that DRete can extract substantial parallelism where token hashing — another method of extracting parallelism from OPS5 matching which is attracting a lot of attention — has little success. The value of extending DRete by incorporating token hashing is also discussed.

References (19)

There are more references available in the full text version of this article.

Cited by (1)

  • Towards connectionist production systems

    1991, Expert Systems With Applications
View full text