Abstract
This is the result of a work done to generalize the Ada Rendez-Vous mechanism, when developing an application distributed among several processes and machines, while keeping a clear separation between the objects semantics and the physical communication issues. The proposed mechanism is based upon a Client-Server architecture, coping with several types of Server (Mono and Multi Client), and requiring only any validated Ada-83 compiler and a task-to-task communication layer.
We describe how such an architecture can be developped using Object-Oriented Design methods, and how its components can afterwards be distributed on different machines in a transparent manner. We show that its implementation depends upon nothing but the Ada Server Specification. We have therefore developed a tool (using Alex and Ayacc utilities to create a simple Ada grammar parser and a generator) capable of automatically building the additionnal bricks needed by the mechanism. The implementation-dependent features dealing with physical communication are kept encapsulated in a generic layer, the only piece to modify should another communication layer be chosen.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bayassi, M., Bitteur, H., Jézéquel, J.F., Legrain, P. (1992). A practical use of the Ada Rendez-Vous paradigm in distributed systems. In: van Katwijk, J. (eds) Ada: Moving Towards 2000. Ada-Europe 1992. Lecture Notes in Computer Science, vol 603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55585-4_25
Download citation
DOI: https://doi.org/10.1007/3-540-55585-4_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55585-8
Online ISBN: 978-3-540-47240-7
eBook Packages: Springer Book Archive