Experience with memory management in open Linda systems
Proceedings of the 2001 ACM symposium on Applied computing
Using mobile code to provide fault tolerance in tuple space based coordination languages
Science of Computer Programming - Special issue on coordination languages and architectures
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
| Hi-index | 0.00 |
Linda is a coordination model which, amongst other things, provides means for abstracting away from the location of information in distributed environments. Although the concept of location abstraction is important, and eases the programming task, it is incomplete in the Linda case. Whenever I/O operations are necessary, users have to be aware of the locations of devices. The use of computational language specific details for distributed I/O restricts the portability of Linda programs. Hitherto Linda has shown us how to write portable distributed algorithms for a variety of applications but for applications involving I/O the portability is compromised. In order to achieve maximum portability, a Linda application has to access I/O using proper Linda facilities. This paper describes a generalization of Linda that includes coordination of distributed I/O. The advantages of such a generalization and the problems involved in the implementation are also discussed.