BONITA: A set of tuple space primitives for distributed coordination

A I T Rowstron; Alan Malcolm Wood

BONITA: A set of tuple space primitives for distributed coordination

Computer Science

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

Abstract

In the last few years the use of distributed structured shared memory paradigms for coordination between parallel processes has become common. One of the most well known implementations of this paradigm is the shared tuple space model las used in Linda). In this paper we describe a new set of primitives for fully distributed coordination of processes and agents using tuple spaces, called the BONITA primitives.;Phe Linda primitives provide synchronous access to tuple spaces, whereas the BONITA primitives provide asynchronous access to tuple spaces. The proposed primitives are able to mimic the Linda primitives, therefore providing the ease of use and expressibility of Linda together with a number of advantages for the coordination of agents or processes in distributed environments. The primitives allow user processes to perform computation concurrently with tuple space accesses, and provide new coordination constructs which lead to more efficient programs.

In this paper we present the (informal) semantics of the BONITA primitives, a description of how the Linda primitives can be modelled using them and a demonstration of the advantages of the BONITA primitives over the Linda primitives.

Original language	English
Title of host publication	THIRTIETH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL 1
Editors	H ElRewini, YN Patt
Place of Publication	LOS ALAMITOS
Publisher	IEEE Computer Society
Pages	379-388
Number of pages	10
ISBN (Print)	0-8186-7743-0
Publication status	Published - 1997
Event	30th Hawaii International Conference on System Sciences (HICSS 30) - WAILEA Duration: 7 Jan 1997 → 10 Jan 1997

Conference

Conference	30th Hawaii International Conference on System Sciences (HICSS 30)
City	WAILEA
Period	7/01/97 → 10/01/97

Cite this

@inproceedings{e44443a85b1648edbb19abaa73f0b8a1,

title = "BONITA: A set of tuple space primitives for distributed coordination",

abstract = "In the last few years the use of distributed structured shared memory paradigms for coordination between parallel processes has become common. One of the most well known implementations of this paradigm is the shared tuple space model las used in Linda). In this paper we describe a new set of primitives for fully distributed coordination of processes and agents using tuple spaces, called the BONITA primitives.;Phe Linda primitives provide synchronous access to tuple spaces, whereas the BONITA primitives provide asynchronous access to tuple spaces. The proposed primitives are able to mimic the Linda primitives, therefore providing the ease of use and expressibility of Linda together with a number of advantages for the coordination of agents or processes in distributed environments. The primitives allow user processes to perform computation concurrently with tuple space accesses, and provide new coordination constructs which lead to more efficient programs.In this paper we present the (informal) semantics of the BONITA primitives, a description of how the Linda primitives can be modelled using them and a demonstration of the advantages of the BONITA primitives over the Linda primitives.",

author = "Rowstron, {A I T} and Wood, {Alan Malcolm}",

year = "1997",

language = "English",

isbn = "0-8186-7743-0",

pages = "379--388",

editor = "H ElRewini and YN Patt",

booktitle = "THIRTIETH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL 1",

publisher = "IEEE Computer Society",

address = "United States",

note = "30th Hawaii International Conference on System Sciences (HICSS 30) ; Conference date: 07-01-1997 Through 10-01-1997",

}

TY - GEN

T1 - BONITA: A set of tuple space primitives for distributed coordination

AU - Rowstron, A I T

AU - Wood, Alan Malcolm

PY - 1997

Y1 - 1997

N2 - In the last few years the use of distributed structured shared memory paradigms for coordination between parallel processes has become common. One of the most well known implementations of this paradigm is the shared tuple space model las used in Linda). In this paper we describe a new set of primitives for fully distributed coordination of processes and agents using tuple spaces, called the BONITA primitives.;Phe Linda primitives provide synchronous access to tuple spaces, whereas the BONITA primitives provide asynchronous access to tuple spaces. The proposed primitives are able to mimic the Linda primitives, therefore providing the ease of use and expressibility of Linda together with a number of advantages for the coordination of agents or processes in distributed environments. The primitives allow user processes to perform computation concurrently with tuple space accesses, and provide new coordination constructs which lead to more efficient programs.In this paper we present the (informal) semantics of the BONITA primitives, a description of how the Linda primitives can be modelled using them and a demonstration of the advantages of the BONITA primitives over the Linda primitives.

AB - In the last few years the use of distributed structured shared memory paradigms for coordination between parallel processes has become common. One of the most well known implementations of this paradigm is the shared tuple space model las used in Linda). In this paper we describe a new set of primitives for fully distributed coordination of processes and agents using tuple spaces, called the BONITA primitives.;Phe Linda primitives provide synchronous access to tuple spaces, whereas the BONITA primitives provide asynchronous access to tuple spaces. The proposed primitives are able to mimic the Linda primitives, therefore providing the ease of use and expressibility of Linda together with a number of advantages for the coordination of agents or processes in distributed environments. The primitives allow user processes to perform computation concurrently with tuple space accesses, and provide new coordination constructs which lead to more efficient programs.In this paper we present the (informal) semantics of the BONITA primitives, a description of how the Linda primitives can be modelled using them and a demonstration of the advantages of the BONITA primitives over the Linda primitives.

M3 - Conference contribution

SN - 0-8186-7743-0

SP - 379

EP - 388

BT - THIRTIETH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL 1

A2 - ElRewini, H

A2 - Patt, YN

PB - IEEE Computer Society

CY - LOS ALAMITOS

T2 - 30th Hawaii International Conference on System Sciences (HICSS 30)

Y2 - 7 January 1997 through 10 January 1997

ER -