(Enter summary)
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 (as 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. The Linda
primitives provide synchronous access to tuple spaces,
whereas the Bonita... (Update)
Similar documents based on text: More All
0.4: Using the BONITA primitives: A case study - Rowstron (1997)
(Correct)
0.3: Using Asynchronous Tuple Space Access Primitives (Bonita.. - Rowstron (1997)
(Correct)
0.2: Distributed Process Creation within a Shared Data Space.. - Robinson, Arthur (1995)
(Correct)
Related documents from co-citation: More All
9: Multiple Tuple Spaces in Linda (context) - Gelernter - 1989
8: WCL: A co-ordination Language for geographically distributed agents
- Rowstron - 1998
7: ACM Transactions on Programming Languages and Systems (context) - Gelernter, in - 1985
BibTeX entry: (Update)
Antony Rowstron and Alan Wood. BONITA: A Set of Tuple Space Primitives for Distributed Coordination. In Hesham El-Rewini and Yale N. Patt, editors, Proc. of the 30th Hawaii International Conference on System Sciences, volume 1, pages 379--388. IEEE Computer Society Press, January 1997. http://citeseer.ist.psu.edu/rowstron97bonita.html More
@inproceedings{ rowstron97bonita,
author = "A. Rowstron and A. Wood",
title = "{Bonita: a set of tuple space primitives for distributed coordination}",
booktitle = "Proc. HICSS30, Sw Track",
publisher = "IEEE Computer Society Press",
address = "Hawaii",
pages = "379--388",
year = "1997",
url = "citeseer.ist.psu.edu/rowstron97bonita.html" }
Citations (may not include all citations):
114
The pvm concurrent computing system: Evolution (context) - Sunderam, Dongarra et al. - 1994
105
Multiple tuple spaces in Linda (context) - Gelernter - 1989
73
How to write parallel programs: A first course (context) - Carriero, Gelernter - 1990
35
Concurrency: Practice and Experience (context) - Butcher, Wood et al. - 1994
31
Designing a coordination model for open systems
- Kielmann - 1996
30
Linda implementation revisited
- Douglas, Wood et al. - 1995
29
Solving the Linda multiple rd problem (context) - Rowstron, Wood - 1996
29
An efficient distributed tuple space implementation for netw..
- Rowstron, Wood - 1996
22
Melinda: Linda with multiple tuple spaces (context) - Hupfer - 1990
18
Towards a Multiple Tuple Space Model (context) - Jensen - 1993
17
Bulk primitives in Linda run-time systems
- Rowstron - 1997
16
Experience with the distributed data structure paradigm in L.. (context) - Kaashoek, Bal et al. - 1989
14
Linda: User's guide and reference manual (context) - Associates - 1995
10
A distributed Linda-like kernel for PVM
- Rowstron, Douglas et al. - 1995
9
ISETLLINDA: Parallel programming with bags
- Douglas, Rowstron et al. - 1995
3
Sonia: an adaption of Linda for coordination of activities i.. (context) - Banville - 1996
1
Copycollect: A new primitive for the linda model
- Rowstron, Douglas et al. - 1996
1
Instructional footprinting and semantic preservation in Lind.. (context) - Landry, Arthur - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://research.microsoft.com/~antr/papers.htm): More
WCL: A Co-ordination Language for Geographically Distributed Agents - Rowstron (1998)
(Correct)
Using the BONITA primitives: A case study - Rowstron (1997)
(Correct)
Solving the Linda multiple problem - Rowstron, Wood
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC