Abstract
In this paper an overview of a novel run time system for the management of tuple spaces, which utilises implicit information about tuple space use in Linda programs to maximise its performance. The approach is novel compared to other tuple space implementations because they either ignore the information, or expect the programmer to provide the information explicitly. A number of experimental results are given to demonstrate the advantages of using the our approach.
Funded by an EPSRC CASE grant with British Aerospace Military Aircraft.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, 1989.
R. Bjornson. Linda on distributed memory multiprocessors. PhD thesis, Yale University, 1992. YALEU/DCS/RR-931.
B. Nielsen and T. Sorensen. Implementing Linda with multiple tuple spaces. Technical report, Aalborg University, Denmark, 1993.
A. Douglas, A. Wood, and A. Rowstron. Linda implementation revisited. In Transputer and occam developments, pages 125–138. IOS Press, 1995.
A. Rowstron, A. Douglas, and A. Wood. A distributed Linda-like kernel for PVM. In EuroPVM'95, pages 107–112. Hermes, 1995.
P. Butcher, A. Wood, and M. Atkins. Global synchronisation in Linda. Concurrency: Practice and Experience, 6(6):505–516, 1994.
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.
A. Rowstron and A. Wood. An efficient distributed tuple space implmentation for networks of heterogenous workstations. Technical Report YCS 270, University of York, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rowstron, A., Wood, A. (1996). An efficient distributed tuple space implementation for networks of workstations. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_69
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive