Parallel operations on class hierarchies with double strand representation

Document Type

Article

Publication Date

12-1-1997

Abstract

This paper continues a series of papers dealing with the problems of (1) fast verification of the existence of a transitive relation in an IS-A hierarchy, and (2) dynamic update of such a hierarchy. As in our previous work, a directed acyclic graph (DAG) of IS-A relationships is replaced by a set of nodes, annotated by number pairs, and stored on a massively parallel computer. In this paper a new mapping of this set of nodes onto the processors is described, called the Double Strand Representation (DSR). The DSR improves the processor usage compared to our previously used Grid Representation (GR). This paper shows IS-A verification and number pair propagation algorithms for the Double Strand Representation. Test runs on a CM-5 Connection Machine3 are reported. © 1997 Elsevier B.V. All rights reserved.

Identifier

77957032544 (Scopus)

Publication Title

Machine Intelligence and Pattern Recognition

External Full Text Location

https://doi.org/10.1016/S0923-0459(97)80005-5

ISSN

09230459

First Page

69

Last Page

94

Issue

C

Volume

20

Grant

F306002-88-C-0031

Fund Ref

Syracuse University

This document is currently not available here.

Share

COinS