Lana–Match algorithm: a parallel version of the Rete–Match algorithm

The Rete–Match algorithm is a matching algorithm used to develop production systems. Although this algorithm is the fastest known algorithm, for many patterns and many objects matching, it still suffers from considerable amount of time needed due to the recursive nature of the problem. In this paper...

Full description

Saved in:
Bibliographic Details
Published in:Parallel computing Vol. 24; no. 5; pp. 763 - 775
Main Authors: Aref, Mostafa M, Tayyib, Mohammed A
Format: Journal Article
Language:English
Published: Elsevier B.V 01.06.1998
Subjects:
Correctness analysis
Distributed memory architecture
Production systems
Rete–Match algorithm
Distributed memory architecture
Production systems
Rete–Match algorithm
Correctness analysis
Performance
ISSN:0167-8191, 1872-7336
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Rete–Match algorithm is a matching algorithm used to develop production systems. Although this algorithm is the fastest known algorithm, for many patterns and many objects matching, it still suffers from considerable amount of time needed due to the recursive nature of the problem. In this paper, a parallel version of the Rete–Match algorithm for distributed memory architecture is presented. Also, a theoretical analysis to its correctness and performance is discussed.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-8191
1872-7336
DOI:10.1016/S0167-8191(98)00003-9