Abstract
Linda is a co-ordination language that has been used for many years. From our recent work on the model we have found a simple operation that is widely used in many different algorithms which the Linda model is unable to express in a viable fashion. We examine a function which performs the composition of two binary relations. By examining how to implement this in parallel using Linda we demonstrate that the current methods are unacceptable. A more detailed explanation of the problem, which we call the multiple rd problem is then presented, together with some other algorithms which have the same problem. We then show how the addition of a primitive to the Linda model, copy-collect, extends the expressibility of the model to overcome this problem. This work builds on previous work on the addition of another primitive called collect[1]. The parallel composition of two binary relations is then reconsidered using copy-collect and is shown to be more efficient.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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. Implementing mathematical morphology in ISETL-Linda. In IEE 5th International Conference on image processing and its applications, pages 847–851, 1995.
N. Carriero and D. Gelernter. How to write parallel programs: A first course. MIT Press, 1990.
A. Douglas, A. Wood, and A. Rowstron. Linda implementation revisited. In P. Nixon, editor, Transputer and occam developments, Transputer and occam Engineering Series, pages 125–138. IOS Press, 1995.
D. Gelernter. Multiple tuple spaces in Linda. In E. Odijk, M. Rem, and J.-C. Syre, editors, PARLE '89: Parallel Architectures and Languages Europe. Volume II: Parallel Languages, pages 20–27. Springer-Verlang, Lecture Notes in Computer Science Volume 366, 1989.
S.C. Hupfer. Melinda: Linda with multiple tuple spaces. Technical Report YALEU/DCS/RR-766, Yale University, 1990.
A. Douglas, A. Rowstron, and A. Wood. ISETL-LINDA: Parallel programming with bags. Technical Report YCS 257, University of York, 1995.
A. Rowstron, A. Douglas, and A. Wood. A distributed Linda-like kernel for PVM. In J. Dongarra, M. Gengler, B. Tourancheau, and X. Vigouroux, editors, EuroPVM'95, pages 107–112. Hermes, 1995.
B. Anderson and D. Shasha. Persistent Linda: Linda + Transactions + Query Processing. In J.P. Banâtre and D. Le Métayer, editors, Research Directions in High-Level Parallel Programming Languages, volume 574 of Lecture Notes in Computer Science. Springer Verlag, 1991.
Scientific Computing Associates. Linda: User's guide and reference manual. Scientific Computing Associates, 1995.
A. Wood and A. Rowstron. Deadlock and algorithm design: Stable marriages in Linda. Submitted to Parallel Processing Letters, 1995.
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). Solving the Linda multiple rd problem. In: Ciancarini, P., Hankin, C. (eds) Coordination Languages and Models. COORDINATION 1996. Lecture Notes in Computer Science, vol 1061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61052-9_56
Download citation
DOI: https://doi.org/10.1007/3-540-61052-9_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61052-6
Online ISBN: 978-3-540-49936-7
eBook Packages: Springer Book Archive