Safertuplespaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1282, Issue , 1997, Pages 289-301

  Van Der Goot, Roel ^a   Schaeffer, Jonathan ^b   Wilson, Gregory V ^c  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b UNIVERSITY OF ALBERTA   (Canada)

^c Visible Decisions Inc   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE;

ACCESS PATTERNS; BLACK BOXES; LINDA PROGRAMMING; PROGRAMMING ERRORS; TUPLE SPACE;

C++ (PROGRAMMING LANGUAGE);

EID: 84957092837     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63383-9_87     Document Type: Conference Paper

References (17)

1. Bakken, D. E., and Schlichting, R. D. Supporting Fault-Tolerant Parallel Programming in Linda. IEEE Transactions on Parallel and Distributed Systems6, 3 (1995), 287–302.
2. Bennett, J. K., Carter, J. B., and Zwaenepoel, W. Munin: Distributed Shared Memory Based on Type-Specific Memory Coherence. In Second ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP) (1990), pp. 168–176.
3. Brown, T., Jeong, K., Li, B., Talla, S., Wyckoff, P., and Shasha, D. PLinda User Manual, http://merv.cs.nyu.edu:8001/~binli/plinda/manual.ps, 1997.
4. Butcher, P., Wood, A., and Atkins, M. Global Synchronisation in Linda. Concurrency: Practice and Experience6, 6 (Sept. 1994), 505–516.
5. Callsen, C. J., Cheng, I., and Hägen, P. L. The AUC C++Linda System. In Linda-Like Systems and Their Implementation, G. Wilson, Ed. Tech. Rep., EPCC TR91–13, Edinburgh Parallel Computing Centre, June 1991, ch. 4, pp. 39–73.
6. Carreira, J., Silva, L., and Silva, J. G. On the design of Eileen: a Linda-like library for MPI. In Proceedings of the 1994 Scalable Parallel Libraries Conference (1995), pp. 175–184.
7. Carriero, N., and Gelernter, D. How To Write Parallel Programs: A First Course. MIT Press, Cambridge, MA, 1990.
8. Carriero, N., and Gelernter, D. Tuple Analysis and Partial Evaluation Strategies in the Linda Precompiler.Research Monographs in Parallel and Distributed Computing. Pitman, London, 1990, ch. 7, pp. 114–125.
9. Ciancarini, P., and Rossi, D. Jada: Coordination and Communication for Java agents. In Mobile Object Systems: Towards the Programmable Internet, 3. Vitek and C. Tschudin, Eds., vol. 1222 of Lecture Notes in Computer Science. Springer Verlag, 1997, pp. 213–228.
10. Gamma, E., Helm, R., Johnson, R., and Vlissides, J. Design Patterns. Addison-Wesley, 1995.
11. Gelernter, D. Multiple Tuple Spaces in Linda. In Proceedings PARLE'89: Parallel Architectures and Languages Europe (June 1989), pp. 20–27.
12. Halstead, A. MultiLisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems7, 4 (1985), 501–538.
13. Jellinghaus, R. Eiffel Linda: An Object-Oriented Linda Dialect. ACM SIGPLAN Notices25, 12 (Dec. 1990), 70–84.
14. Kielmann, T. Designing a Coordination Model for Open Systems. In Coordination Languages and Models, First International Conference COORDINATION '96 (1996), P. Ciancarini and C. Hankin, Eds., pp. 267–284.
15. Matsuoka, S., and Kawai, S. Using Tuple-Space Communication in Distributed Object-Oriented Architectures. Proceedings ACM Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA) 23, 11 (1988), 276-284.
16. Rowstron, A., and Wood, A. Solving the Linda Multiple rd Problem. In Coordination Languages and Models, First International Conference COORDINATION '96 (1996), P. Ciancarini and C. Hankin, Eds., pp. 357–367.
17. Szafron, D., and Schaeffer, J. An Experiment to Measure the Usability of Parallel Programming Systems. Concurrency: Practice and Experience8, 2 (1996), 147–166.