Application specific conversation schemes for ADA programs

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 c...

Full description

Saved in:
Bibliographic Details
Published inMicroprocessing and microprogramming Vol. 41; no. 10; pp. 703 - 713
Main Author Romanovsky, Alexander
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.06.1996
Subjects
Online AccessGet full text
ISSN0165-6074
DOI10.1016/0165-6074(95)00014-3

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0165-6074
DOI:10.1016/0165-6074(95)00014-3