Ada Binding to a Shared Object Layer
Conference paper
First Online:
- 292 Downloads
Abstract
CORSO, a coordination system for virtual shared memory, allows bindings to different programming languages. Currently C, C++, Java, VisualBasic, and Oracle’s Developer2000 are supported. We implement an Ada binding to CORSO, thus opening the area of virtual shared memory to the Ada world. Our Ada CORSO binding enhances Ada with transaction-oriented, fault-tolerant, distributed objects in a straight-forward way without having to extend the Ada language.
Keywords
Message Passing Shared Object Tuple Space Service Invocation Remote Procedure Call
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.D. E. Bakken, Supporting fault-tolerant parallel programming in LINDA, Ph.D. thesis, University of Arizona, Department of Computer Science, 1994.Google Scholar
- 2.M. R. Eskicioglu, A comprehensive bibliography of distributed shared memory, Tech. Report TR96-17, University of Alberta, Edmonton, Canada, 1996.Google Scholar
- 3.eva Kühn and Georg Nozicka, Post-client/server coordination tools, Proc. of the Second Asian Computer Science Conference on Coordination Technology for Collaborative Applications, LNCS, Springer-Verlag, 1997.Google Scholar
- 4.ISO/IEC 8652, Ada reference manual, 1995.Google Scholar
- 5.Y. Kermarrec and L. Pautet, Ada-Linda: A powerful paradigm for programming distributed Ada applications, Proceedings of the TRI-Ada’94 conference (Baltimore, Maryland), 1994, pp. 438–445.Google Scholar
- 6.Kristina Lundqvist and Göran Wall, Using object oriented methods in Ada 95 to implement Linda, Proceedings of Ada-Europe’96 (Montreux, Switzerland), Springer-Verlag, 1996, pp. 211–222.Google Scholar
- 7.Göran Wall and Kristina Lundqvist, Shared packages through Linda, Proceedings of Ada-Europe’96 (Montreux, Switzerland), Springer-Verlag, 1996, pp. 223–234.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1999