An efficient distributed tuple space implementation for networks of workstations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1123, Issue , 1996, Pages 510-513

  Rowstron, Antony ^a   Wood, Alan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE;

DISTRIBUTED TUPLE SPACES; IMPLICIT INFORMATIONS; NETWORKS OF WORKSTATIONS; RUN TIME SYSTEMS; TUPLE SPACE;

INFORMATION MANAGEMENT;

EID: 84955609846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61626-8_69     Document Type: Conference Paper

References (8)

1. N. Carriero and D. Gelernter. Linda in context. Communications of the A CM, 32(4):444-458, 1989.
2. R. Bjornson. Linda on distributed memory multiprocessors. PhD thesis, Yale University, 1992. YALEU/DCS/RR-931.
3. B. Nielsen and T. Sorensen. Implementing Linda with multiple tuple spaces. Technical report, Aalborg University, Denmark, 1993.
4. A. Douglas, A. Wood, and A. Rowstron. Linda implementation revisited. In Transputer and occam developments, pages 125-138. IOS Press, 1995.
5. A. Rowstron, A. Douglas, and A. Wood. A distributed Linda-like kernel for PVM. In EuroPVM’95, pages 107-112. Hermes, 1995.
6. P. Butcher, A. Wood, and M. Atkins. Global synchronisation in Linda. Concurrency: Practice and Experience, 6(6):505-516, 1994.
7. A. Rowstron and A. Wood. Solving the Linda multiple rd problem. In Coordination Languages and Models, volume 1061 of LNCS, pages 357-367. Springer-Velag, 1996.
8. A. Rowstron and A. Wood. An efficient distributed tuple space implmentation for networks of heterogenous workstations. Technical Report YCS 270, University of York, 1996.