Ada 95 Rationale. Intermetrics Inc, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....partitions through remote call interfaces, or by reading and updating variables in shared passive packages residing in passive partitions. The restrictions imposed on shared passive packages by the standard suggest that they are intended for use only when partitions share a logical address space [2]. This can be achieved either by the use of shared physical memory, where the logical and physical address space are identical, or through distributed shared virtual memory (DSVM) An example of distributed shared virtual memory for Ada can be found in [3] On a system not having DSVM or on a ....

"Ada 95 Rationale", January 1995, Intermetrics Inc.

....application allows global properties of the system to be analysed, such as mutual exclusion for shared resources, and an example of how this can be performed with the assistance of a theorem prover is given. 2 Kernel Requirements The kernel is intended to form the basis of a restricted Ada 95 [Ada95] runtime support system, optimised for use in a hard real time environment. The set of operations that is included in the kernel is kept to a minimum to simplify the specification, facilitate formal analysis of the kernel, and improve the performance of any implementation. Annexes C (Systems ....

....set of operations that is included in the kernel is kept to a minimum to simplify the specification, facilitate formal analysis of the kernel, and improve the performance of any implementation. Annexes C (Systems Programming) and D (Real Time Systems) of the Ada 95 Language Reference Manual (LRM) Ada95] contain specific language extensions to cater for real time systems 1 . These allow certain language features to be either adapted or removed to ensure that the final system has predictable timing performance, as described later. The computational model that the kernel supports is based on a ....

Ada 95 Language Reference Manual. Intermetrics Inc., 1995. ISO/IEC 8652:1995.

....interact allows global properties of the system to be analysed, such as mutual exclusion for shared resources, and an example of how this can be performed with the assistance of a theorem prover is given. 2 Kernel Requirements The kernel is intended to form the basis of a restricted Ada 95 [Ada95] runtime support system, optimised for use in a hard real time environment. The set of operations that is included in the kernel is kept to a minimum to simplify the specification, facilitate formal analysis of the kernel, and improve the performance of any implementation. Annexes C (Systems ....

....set of operations that is included in the kernel is kept to a minimum to simplify the specification, facilitate formal analysis of the kernel, and improve the performance of any implementation. Annexes C (Systems Programming) and D (Real Time Systems) of the Ada 95 Language Reference Manual (LRM) Ada95] contain specific language extensions to cater for real time systems. These allow certain language features to be either adapted or removed to ensure that the final system has predictable timing performance, as described later. The computational model that the kernel supports is based on a fixed ....

Ada 95 Language Reference Manual. Intermetrics Inc., 1995. ISO/IEC 8652:1995.

....be overcome by the engineers implementing their own scheduler. However, Locke s [6] observations were made with respect to the Ada 83 version [90] of the Ada language. The difficulties associated with the tasking model in Ada 83 may be avoided by using the Ada 95 version of the language standard [91] that includes a revised tasking model as well as support for important scheduling paradigms. These include priority inheritance implemented with priority ceiling protocols. Despite the change, the SPARK subset of Ada 95 [92] still precludes the use of tasking models. An equally strong influence ....

Ada 95 Language Reference Manual. Intermetrics Inc., 1995. ISO/IEC 8652:1995.

.... Likewise, the rules call for the main memory to be updated at synchronization 1 Note that the term volatile adopted by Java designates a variable as noncacheable, whereas in parallel programming this term has traditionally meant that a variable is cacheable but may be updated by other processors [1]. points by invalidating all copies in the working memory of a thread on entry to a monitor (monitorenter) and by writing to main memory all newly generated values on exit from a monitor (monitorexit) Although the Java shared data model is weakly consistent, it is not weak enough to allow the ....

....it is not weak enough to allow the oblivious caching and out of order access of variables between synchronization points. For example, Java requires that a) the updates by one thread be totally ordered and b) the updates to any given variable lock be totally ordered. Other languages, such as Ada [1], only require that updates to shared variables be effective at points where threads (tasks in Ada) explicitly synchronize, and therefore, a RTS can make better use of memory hierarchies [11] A Java implementation does not have enough freedom to fully exploit optimization opportunities provided ....

Ada 95 Rationale. Intermetrics Inc, 1995.

No context found.

Annotated Ada 95 Reference Manual, Version 6.0. Intermetrics Inc, 1995.

No context found.

Ada 95 Rationale. Intermetrics Inc, 1995.

No context found.

---: Ada 95 Reference Manual. Intermetrics Inc., Feb 15, 1995 (ISO/ IEC 8652:1995)

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