C. Atkinson, T. Moreton and A. Natali, Ada for Distributed Systems, Cambridge University Press, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Proposal to Improve Reusability in a Language based.. - Araque, Capel.. (1997) (Correct)
....such as PVM [5] but they don t allow the verification of the total correctness of programs. Others, even though carried out by important scientists, e.g. Joyce [6] haven t achieved the necessary diffusion to be implemented in concrete architectures. And classical languages, like Ada [3], are not adequate to be implemented efficiently without severely restricting the language constructions in a distributed system. None of the aforementioned problems affect the Occam CSP model of distributed programming. The Occam [2] language is an almost complete implementation of the CSP [1] ....
Atkinson, C., Moreton, T. Natali, A. "Ada for distributed systems". Cambridge University Press, 1988.
Distributed Debugging - A Case Study - Kunz (1992) (Correct)
....derived manually for it. These abstractions are based on the process view and the temporal view of distributed application behaviour discussed earlier. 3. 1 Description of the Application The distributed application used is a simulation of an airport shuttle system as described in Atkinson et al. [6] and Kramer et al. 32] This airport shuttle system transports passengers between four terminals, see Figure 2. platform panel panel panel panel south west north west south east north east platform platform platform Figure 2: Layout of the airport shuttle system Passengers signal their travel ....
Colin Atkinson, Trevor Moreton, and Antonio Natali, editors. Ada for Distributed Systems. Cambridge University Press, Cambridge et al., 1988.
Programming Paradigms and Clustering Rules - Kunz (1993) (Correct)
....and checks, starting from the leaves, whether a source module has to be recompiled. Even with all targets upto date, executing makehermes generates 175 processes (51 application processes plus 124 system processes) Shuttle simulates an airport shuttle system, similar to the one described in [6] and [34] This airport shuttle system transports passengers between four terminals. Passengers signal their travel request by pushing a destination button at the control panel of their station and are serviced on a first come first served basis. Shuttle is a simulation of such a shuttle ....
Colin Atkinson, Trevor Moreton, and Antonio Natali, editors. Ada for Distributed Systems. Cambridge University Press, Cambridge et al., 1988.
An Event Abstraction Tool: Theory, Design, and Results - Kunz (1994) (Correct)
....than 3 minutes, 53 seconds for the creation of all potential execution histories for all 17 application processes and 103 seconds for the derivation of the event abstraction hierarchy. 5 Results The distributed application discussed here is a simulation of an airport shuttle system described in [11, 61]. This airport shuttle system transports passengers between four terminals, see Figure 8. 5 All times are measured on a HP Apollo Series 400 workstation with 16 MByte main memory. The workstation runs under HP UX 8.0. SouthEast panel panel panel panel platform platform platform platform ....
Colin Atkinson, Trevor Moreton, and Antonio Natali, editors. Ada for Distributed Systems. Cambridge University Press, Cambridge et al., 1988.
ADA's Virtual Node based Water System Simulator - Hosseinzaman, Bargiela (Correct)
....structure and provides explicit specification of parallelism. However, since Ada was not originally designed for distributed systems, it has been necessary to extend Ada s rendezvous mechanism to facilitate network communications. This mechanism is the Ada Virtual Node model described in [4]. 2. Water System Simulation The telemetry systems employed in water distribution networks consist of a number of remote stations relaying information about flows and pressures at some discrete points in the network. However, to get a global view of the water distribution system this data needs ....
....computations. Although Ada provides an intertask communication mechanism in the form of rendezvous, for the single processor environment, this mechanism requires extension because Ada was not originally designed for distributed systems[5] This mechanism is the Ada Virtual Node model described in[4]. Virtual Nodes can be completely defined in terms of Ada concepts. In the most general case they are the transitive closure of a procedure in an Ada library; the units of such closure must be compliant with a set of composition rules which provides the virtual node with the required properties. ....
Atkinson C.,Moreton T., & Natali A.,"Ada for distributed systems", Cambridge Univ. Press,1988.
The Distributed Ada Run-time System DARTS - Gothe, Wengelin, Asplund (1991) (Correct)
No context found.
C. Atkinson, T. Moreton and A. Natali, Ada for Distributed Systems, Cambridge University Press, 1988.
Fault Tolerance in Distributed Ada 95 - Wolf (1997) (1 citation) (Correct)
No context found.
Atkinson, C.; Moreton, T.; Natali, A.: Ada for Distributed Systems, The Ada Companion Series, Cambridge University Press 1988
G Numerics - The Numerics (Correct)
No context found.
C. Atkinson, T. Moreton, and A. Natali (editors). Ada for Distributed Systems. The Ada Companion Series, Cambridge University Press, 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC