By Topic

LINDA for case base retrieval: a case for extending the functionality of LINDA and its abstract machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Campbell, D.K.G. ; Dept. of Comput. Sci., York Univ., UK ; Wood, A.M. ; Osborne, H.R. ; Bridge, D.G.

Case based reasoning (CBR) retrieval operations with partial ordering similarity measures have been implemented in LINDA to extract generic operations and identify potential parallelism in CBR. Mapping and reduction operations, and constraint matching versions of all retrieval operations were identified, then implemented in LINDA. Their operational semantics were expressed in terms of the CHAM for Liam (LINDA abstract machine) and refined to produce the basis for efficient, parallel implementations of the operations as additional LINDA instructions. The implementation of the constraint matching operations suggests the use of eval() to achieve process migration in distributed systems, and default local tuple space interaction. It as suggested that the constraint matching instructions replace the basic matching retrieval instructions, as they extend the functionality of the matching process by maintaining atomicity of matching and moving the constraint function from the program to the LINDA kernel

Published in:

System Sciences, 1998., Proceedings of the Thirty-First Hawaii International Conference on  (Volume:7 )

Date of Conference:

6-9 Jan 1998