This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Communications Directed by Bound Types in Linda: Presentation and Formal Model
August 2002 (vol. 13 no. 8)
pp. 828-843

Abstract—Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show in this paper that this model suffers from the false matching phenomenon. We explain under which conditions this problem occurs, we examine the solutions already proposed to solve it, and we show why they are not sufficient. In this framework, our goal is to propose an extension to the Linda model in order to eliminate the false matching phenomenon. This model—Linda with bound types or B-Linda—suitable for modern programming paradigms, adds an extended-type notion into the basic Linda model. It is first introduced in an informal manner, then we present an implementation of it. Some formal aspects are specified in the appendix: The definition of the model's elements and operational semantics.

[1] D. Gelernter, N. Carriero, S. Chandran, and S. Chang, “Parallel Programming in Linda,” Proc. Int'l Conf. Parallel Programming, pp. 255-263, Aug. 1985.
[2] G. Agha and C.J. Callsen, “Actorspaces: An Open Distributed Programming Paradigm,” Proc. Fourth ACM Conf. Principles and Practice of Parallel Programming, ACM SIGPLAN Notices, vol. 28, pp. 23-32, 1993.
[3] T. Matson, R. Bjorson, and D. Kaminsky, “The C-Linda Language for Network of Workstations,” technical report, Scientific Computer Assoc., New Haven, Conn., 1992.
[4] E. Siegel and E. Cooper, “Implementing Distributed Linda in Standard ml,” technical report, Carnegie Mellon Univ. School of Computer Science, Pittsburg, Penn., 1991.
[5] Sun Microsystems, JavaSpaces Service Specification, 2000.
[6] N.H. Minsky and J. Leichter, “Law-Governed Linda as a Coordination Model,” Object-Based Models and Languages for Concurrent Systems, P. Ciancarini, O. Nierstrasz, and A. Yonezawa, eds., pp. 125-146, 1995.
[7] T.J. Lehman, S.W. McLaughry, and P. Wyckoff, “Tspaces: The Next Wave,” Hawaii Int'l Conf. System Sciences, 1999.
[8] W. Shoenfielinger, “WWW Meets Linda: Linda for Global WWW-Based Transaction Processing Systems,” World Wide Web J., 1995.
[9] N. Carriero and D. Gelernter, How to Write Parallel Programs: A first Course. Cambridge, Mass.: The MIT Press, 1990.
[10] W. Leler, “Linda Meets Unix,” Computer, vol. 23, no. 2, pp. 43-55, Feb. 1990.
[11] J. Pinakis, “Using Linda as the Basis of an Operating System Microkernel,” PhD thesis, Dept. Computer Science, Univ. of Western Australia Nedlands, Australia, 1993.
[12] P. Ciancarini, A. Knoche, R. Tolksdorf, and F. Vitali, “Pagespace: An Architecture to Coordinate Distributed Applications on the Web,” Proc. Fifth Int'l World Wide Web Conf., May 1996.
[13] J.S. Leichter, “Shared Memories, Buses, and Lans—Linda Implementations Across the Spectrum of Connectivity,” Technical Report YALEU/DCS/TR-714, Dept. of Computer Science, Yale Univ., 1993.
[14] D. Gelernter, "Multiple Tuple Spaces in LINDA," Proc. Conf. Parallel Architectures and Languages Europe, Vol. 2, Lecture Notes in Computer Science, No. 366, 1989, pp. 20-27.
[15] S. Hupfer, “Melinda: Linda with Multiple Tuple Spaces,” Research Report YALEU/DCS/RR-766, Dept. Computer Science, Yale Univ., New Haven, Conn., Feb. 1990.
[16] Scientific Computing Associates, Paradise User's Guide and Reference Manual, 2000.
[17] T.J. Lehman et al., “Hitting the Distributed Computing Sweet Spot with Tspaces,” Computers Networks, no. 35, pp. 457-472, 2001.
[18] A. Gibaud and P. Thomin, “Linda Typé: Une Extension du Modèle Linda Pour Environnement Multiapplicatif. [Typed Linda: An Extension of the Linda Model for Multiapplicative Environment],” Technique et Science Informatiques (TSI), vol. 19, pp. 43-74, 1999.
[19] K. Jeong and D. Shasha, “Plinda 2.0: A Transactional/Checkpointing Approach to Fault Tolerant Linda,” 1994.
[20] D. Bakken and R. Schlichting, “Supporting Fault Tolerant Parallel Programming in Linda,” Technical Report 18, Dept. Computer Science, Univ. of Arizona, Tucson, Az., 1993.
[21] A. Gibaud and P. Thomin, “Linda Typé: Une Approche Plus Sûre de la Programmation Distribuée Avec Linda. [Typed Linda: A Safer Approach to Distributed Programming with Linda],” Calculateurs Parallèles, vol. 8, no. 4, pp. 365-392, Dec. 1996.
[22] G. Plotkin, “A Structural Approach to Operational Semantics,” Technical Report DAIMI FN-19, Dept. of Computer Science, Aarhus Univ., Denmark, 1981.
[23] C. Priami, “Enhanced Operational Semantics for Concurrency,” PhD thesis, Univ. di Pisa-Genova-Udine, Pisa, Italy, 1996.
[24] P. Ciancarini, K. Jensen, and D. Yankelevitch, “The Semantics of a Parallel Language Based on a Shared Data Space,” technical report, Univ. di Pisa, Pisa, Italy, 1992.

Index Terms:
Asynchronous parallelism, distributed shared memory, Linda model, distributed application, type, directed communication, false matching, type scope.
Citation:
Alain Gibaud, Philippe Thomin, "Communications Directed by Bound Types in Linda: Presentation and Formal Model," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 8, pp. 828-843, Aug. 2002, doi:10.1109/TPDS.2002.1028439
Usage of this product signifies your acceptance of the Terms of Use.