Toggle Main Menu Toggle Search

Open Access padlockePrints

Application specific conversation schemes for ADA programs

Lookup NU author(s): Professor Alexander RomanovskyORCiD


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


The paper considers a development of the conversation scheme version proposed by A. Clematis and V. Gianuzzi in Microprocessing and Microprogramming (Vol. 32, No. 1-5, 1991) [5] and Computer Languages (Vol. 18, No. 3, 1993) [6]. The authors discussed the methodology of using conversations within a conventional concurrent language (Ada), which makes the conversation scheme practical. In our paper we concentrate on the improvements for their scheme. We believe that it is important for the programmer to have more choice, and propose what could be called a library of schemes from which the appropriate scheme could be chosen depending on the application. We discuss ways of setting dynamically the number of processes participating in a conversation; of having different sets of servers involved in different alternates of the same conversation; of introducing a global acceptance test which would be more sophisticated; of increasing robustness of the conversation. All of these proposals are meant to be used within a conventional language.

Publication metadata

Author(s): Romanovsky A

Publication type: Article

Publication status: Published

Journal: Microprocessing and Microprogramming

Year: 1996

Volume: 41

Issue: 10

Pages: 703-713

Print publication date: 01/06/1996

ISSN (print): 0165-6074

ISSN (electronic):

Publisher: Elsevier BV


DOI: 10.1016/0165-6074(95)00014-3


Altmetrics provided by Altmetric