1989
DOI: 10.1109/32.21756
|View full text |Cite
|
Sign up to set email alerts
|

Translation and execution of distributed Ada programs: Is it still Ada?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1990
1990
1996
1996

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 36 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…Previous work [10,22] shows the need for an algorithm to assign ADT modules to processors, but development of such an algorithm was not the focus of their work. In [22], one item identified as distributed (assignable) is the Ada package, which is similar to the module considered here.…”
Section: Related Workmentioning
confidence: 97%
See 1 more Smart Citation
“…Previous work [10,22] shows the need for an algorithm to assign ADT modules to processors, but development of such an algorithm was not the focus of their work. In [22], one item identified as distributed (assignable) is the Ada package, which is similar to the module considered here.…”
Section: Related Workmentioning
confidence: 97%
“…In [22], one item identified as distributed (assignable) is the Ada package, which is similar to the module considered here. APPL [10] is a language for specifying mappings of Ada programs to architectures.…”
Section: Related Workmentioning
confidence: 98%
“…The distribution of many Ada constructs, including tasks, can cause difficulties such as hidden remote objec t references, a need for remote context transmission, or complex termination protocols for some memory/processo r configurations [1] . While some of these difficulties can be overcome with restrictions, the desirability of a restriction is a function of the configuration .…”
Section: Incompleteness Of Reference Manua Lmentioning
confidence: 99%
“…The plan is then transformed, manually or automatically, into a sequence of messages in the execution taxonomy. This transformation may be viewed as the mapping of a sequential program into a set of concurrent distributed processes, encapsulated in objects [12].…”
Section: Problem Definitionmentioning
confidence: 99%