Using Logical Operators as an Extended Coordination Mechanism in Linda
In the last 20 years of research in coordination, researchers were able to demonstrate that distributed languages are made of two distinct parts: a computation and a coordination language. Among a plethora of coordination models (the basis of a coordination language) available today, Linda is perhaps the most successful. Linda advocates that processes should interact solely via associative shared memories called tuple spaces. Linda has developed from a single-tuple-space into a multiple-tuple-space model but the coordination mechanism used was never extended to express the multiple-tuple-space model full potential. This paper describes an extension of the Linda model, called LogOp, where primitives can use logical operators to combine tuple spaces on-the-fly. It is argued that LogOp provides a simpler and more elegant coordination mechanism than Linda. An implementation of LogOp is also described and initial results indicate that LogOp implementations are efficient when dealing with multiple tuple spaces.
KeywordsLogical Operator Coordination Mechanism Coordination Pattern Coordination Model Tuple Space
Unable to display preview. Download preview PDF.
- 2.A. Douglas, A. Wood, and A. Rowstron. Linda Implementation Revisited. In P. Nixon, editor, Proc. of the 18th World Occam and Transputer User Group, pages 125–138. IOS Press, April 1995.Google Scholar
- 4.D. Gelernter. Multiple Tuple Spaces in Linda. In Proc. of PARLE 89, pages 20–27. Springer-Verlag, 1989.Google Scholar
- 5.IBM Corporation. T Spaces Programmer’s Guide, 1998. Eletronic version only. http://www.almaden.ibm.com/cs/TSpaces/.
- 6.J. Jacquet and K. DeBosschere. On Relating Blackboards in the mLog Coordination Model. In Proc. HICSS30, Sw Track, pages 359–368, Hawaii, 1997. IEEE Computer Society Press.Google Scholar
- 7.R. Menezes. Experience with Memory Management in Open Linda Systems. In Proceedings of the 16th ACM Symposium on Applied Computing, pages 187–196. ACM, March 2001.Google Scholar
- 8.R. Menezes and A. Wood. Garbage Collection in Linda using Tuple Monitoring and Process Registration. In Proc. of the 10th International Conference on Parallel and Distributed Computing and Systems, pages 490–495, Las Vegas, Nevada, USA, 1998. Acta Press.Google Scholar
- 9.I. Merrick and A. Wood. Coordination with scopes. In Proceedings of the 2000 ACM symposium on Applied computing 2000, volume 1, pages 210–217, Como, Italy, March 2000. ACM.Google Scholar
- 10.G. P. Picco, A. L. Murphy, and G.-C. Roman. Lime: Linda Meets Mobility. In D. Garlan, editor, Proceedings of the 21st International Conference on Software Engineering (ICSE’99), pages 368–377, Los Angeles, CA, USA, May 1999. ACM Press.Google Scholar
- 12.A. Rowstron and A. Wood. An Efficient Distributed Tuple Space Implementation for Networks of Workstations. In L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Euro-Par’96, volume 1123 of Lecture Notes in Computer Science, pages 510–513. Springer-Verlag, 1996.Google Scholar
- 13.A. Rowstron and A. Wood. Bonita: A Set of Tuple Space Primitives for Distributed Coordination. In H. El-Rewini and Y. N. Patt, editors, Proc. of the 30th Hawaii International Conference on System Sciences, volume 1, pages 379–388. IEEE Computer Society Press, January 1997.Google Scholar