E.W. Giering and T.P. Baker. The Gnu Ada Runtime Library (GNARL): Design and implementation. Wadas'94 Proceedings, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Detailed Description of the GNU Ada Run Time (Version 1.0) - Miranda Self-citation (Ada) (Correct)
....and function calls, without direct reference to RTS data structures aside from the parameters of the RTS subprograms. The RTS data structures may be kept in a separate address space, protected from access by the application. The direction of call is always from application code to the RTS [GB94a, Section 2]. The exceptions to this rule are: Task creation, in which the compiler passes to the RTS the address of a procedure corresponding to the task body. Protected entries, in which the compiler passes to the RTS the address of an array with the reference to the subprograms generated by the ....
....compiler itself, and allows a knowledgeable user to modify the run time if he she Pthreads POSIX Threads. so chooses. The design of GNARL is based on the CARTS (Common Ada RunTime System) specification [SGC94, Section 3. 6] The original design objectives of GNARL, in order of priority, were [GB94a, Section 1]: 1. Semantic correctness. GNARL must support the full core tasking semantics, and as much of the Real Time Systems and Systems Programming annexes as permitted by other constraints. 2. Timeliness. Development should be incremental, so that working partial implementations can be delivered early. ....
E.W. Giering and T.P. Baker. The Gnu Ada Runtime Library (GNARL): Design and implementation. Wadas'94 Proceedings, 1994.
Timing Analysis of Ada Tasking Programs - Corbett (1996) (22 citations) Self-citation (Ada) (Correct)
....those constructs. The details of the data structures used to hold this information, as well as the code used to implement the constructs, varies from compiler to compiler. In order to understand how an Ada run time system could be implemented, we looked at the GNU Ada Run time Library (GNARL) [20], the run time system of the GNU Ada Translator (GNAT) The design and implementation of GNARL is described in several papers [19 21] and its source code is freely available. Many of the state variables we use in our model of the run time system are abstractions of data structures used by GNARL. ....
....If awakened by the caller, the task cancels the pending timer signal by removing the alarm from Timers[T ] A delay (until) alternative can also be used in a timed entry call to bound the time the caller will wait for the entry to be accepted. We use a simple source transformation given in [20] to implement a timed entry call using an asynchronous transfer of control. C.4 Other Constructs We can use the same basic method to model Ada s other concurrent and real time constructs. Since all such constructs are implemented by code that simply manipulates run time structures and invokes ....
[Article contains additional citation context not shown here]
E. W. Giering and T. P. Baker. The Gnu Ada runtime library (GNARL): Design and implementation. In Proceedings of the Eleventh Annual Washington Ada Symposium and Summer ACM SIGAda Meeting (WAdaS '94), June 1994.
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