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

D K G Campbell; H R Osborne; D G Bridge; Alan Malcolm Wood

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

D K G Campbell, H R Osborne, D G Bridge, Alan Malcolm Wood

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 af operations were identified, then implemented in LINDA. Their operational semantics were expressed in terms of the CHAM for Liam (the 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 Else of eva1 () to achieve process migration ill distributed systems, and default local tuple space interaction, ft as suggested that the constraint matching instructions replace the basic matching retrieval instructions, as they extend the functionality of the marching process by maintaining atomicity of matching and moving the constraint function from the program to the LINDA kernel.

Original language	English
Title of host publication	PROCEEDINGS OF THE THIRTY-FIRST HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL VII
Editors	H ElRewini
Place of Publication	LOS ALAMITOS
Publisher	IEEE Computer Society
Pages	226-235
Number of pages	10
ISBN (Print)	0-8186-8255-8
Publication status	Published - 1998
Event	31st Hawaii International Conference on System Sciences (HICSS-31) - KOHALA COAST Duration: 6 Jan 1998 → 9 Jan 1998

Conference

Conference	31st Hawaii International Conference on System Sciences (HICSS-31)
City	KOHALA COAST
Period	6/01/98 → 9/01/98

Cite this

@inproceedings{b29ab68ca2c14d1b9e6bbaefcbe2b141,

title = "LINDA for case base retrieval: A case for extending the functionality of LINDA and its abstract machine",

abstract = "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 af operations were identified, then implemented in LINDA. Their operational semantics were expressed in terms of the CHAM for Liam (the 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 Else of eva1 () to achieve process migration ill distributed systems, and default local tuple space interaction, ft as suggested that the constraint matching instructions replace the basic matching retrieval instructions, as they extend the functionality of the marching process by maintaining atomicity of matching and moving the constraint function from the program to the LINDA kernel.",

author = "Campbell, {D K G} and Osborne, {H R} and Bridge, {D G} and Wood, {Alan Malcolm}",

year = "1998",

language = "English",

isbn = "0-8186-8255-8",

pages = "226--235",

editor = "H ElRewini",

booktitle = "PROCEEDINGS OF THE THIRTY-FIRST HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL VII",

publisher = "IEEE Computer Society",

address = "United States",

note = "31st Hawaii International Conference on System Sciences (HICSS-31) ; Conference date: 06-01-1998 Through 09-01-1998",

}

Campbell, DKG, Osborne, HR, Bridge, DG & Wood, AM 1998, LINDA for case base retrieval: A case for extending the functionality of LINDA and its abstract machine. in H ElRewini (ed.), PROCEEDINGS OF THE THIRTY-FIRST HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL VII. IEEE Computer Society, LOS ALAMITOS, pp. 226-235, 31st Hawaii International Conference on System Sciences (HICSS-31), KOHALA COAST, 6/01/98.

LINDA for case base retrieval: A case for extending the functionality of LINDA and its abstract machine. / Campbell, D K G; Osborne, H R; Bridge, D G et al.
PROCEEDINGS OF THE THIRTY-FIRST HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL VII. ed. / H ElRewini. LOS ALAMITOS: IEEE Computer Society, 1998. p. 226-235.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - LINDA for case base retrieval: A case for extending the functionality of LINDA and its abstract machine

AU - Campbell, D K G

AU - Osborne, H R

AU - Bridge, D G

AU - Wood, Alan Malcolm

PY - 1998

Y1 - 1998

N2 - 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 af operations were identified, then implemented in LINDA. Their operational semantics were expressed in terms of the CHAM for Liam (the 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 Else of eva1 () to achieve process migration ill distributed systems, and default local tuple space interaction, ft as suggested that the constraint matching instructions replace the basic matching retrieval instructions, as they extend the functionality of the marching process by maintaining atomicity of matching and moving the constraint function from the program to the LINDA kernel.

AB - 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 af operations were identified, then implemented in LINDA. Their operational semantics were expressed in terms of the CHAM for Liam (the 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 Else of eva1 () to achieve process migration ill distributed systems, and default local tuple space interaction, ft as suggested that the constraint matching instructions replace the basic matching retrieval instructions, as they extend the functionality of the marching process by maintaining atomicity of matching and moving the constraint function from the program to the LINDA kernel.

M3 - Conference contribution

SN - 0-8186-8255-8

SP - 226

EP - 235

BT - PROCEEDINGS OF THE THIRTY-FIRST HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL VII

A2 - ElRewini, H

PB - IEEE Computer Society

CY - LOS ALAMITOS

T2 - 31st Hawaii International Conference on System Sciences (HICSS-31)

Y2 - 6 January 1998 through 9 January 1998

ER -