Optimising the Linda in Primitive: Understanding Tuple-Space Run-times

Abstract

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. SAC 2000 Villa Olmo, Como, Italy Copyright 2000 ACM 0-89791-88-6/97/05 ..$5.00 in primitive. In this paper we present an interesting interpretation of the semantics of the Linda in primitive, or to generalise, of any blocking primitive that destructively removes tuples from a tuple space.

DOI: 10.1145/335603.335749

Cite this paper

@inproceedings{Rowstron2000OptimisingTL, title={Optimising the Linda in Primitive: Understanding Tuple-Space Run-times}, author={Antony I. T. Rowstron}, booktitle={SAC}, year={2000} }