A.W. Appel, "A Runtime System", Tech. Report CS-TR-220-89, Dept. of Computer Science, Princeton University, 1989.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of the application into account by situating the recovery lines in favourable positions in the application, yielding less checkpoint data. Such recovery lines yielding the smallest amount of checkpoint data can also be found if the programming language supports automatic garbage collection [Appe89]. The compiler may then insert checkpoint calls after major garbage collection instructions. 3.8 Optimal Checkpointing Technique From the previous descriptions of backward error recovery techniques, let us derive the conditions which an optimal checkpointing approach for our targets must ....

A.W. Appel, "A Runtime System", Tech. Report CS-TR-220-89, Dept. of Computer Science, Princeton University, 1989.

....In principle, the presence of higher order functions means that procedure activation records must be allocated on the heap. With a suitable analysis, a stack can be used to store most activation records [Kranz et al. 1986] However, using only a heap simplifies the compiler, the run time system [Appel 1990], and the implementation of first class continuations [Hieb et al. 1990] The decision to use only a heap was controversial because it greatly increases the amount of heap allocation, which is believed to cause poor memory system performance. 3. RELATED WORK There have been many studies of the ....

....FORTRAN benchmark [Crowley et al. 1978] translated into ID [Ekanadham and Arvind ] and then translated into Standard ML by Lal George. VLIW A Very Long Instruction Word instruction scheduler written by John Danskin. YACC A LALR(1) parser generator, implemented by David R. Tarditi [Tarditi and Appel 1990], processing the grammar of Standard ML. Table I. Benchmark Programs Size Run time Program Lines Heap size (Kbytes) Code size (Kbytes) Non gc (sec) Gc (sec) CW 5728 1107 894 22.74 3.09 Knuth Bendix 491 2768 251 13.47 1.48 Lexgen 1224 2162 305 15.07 1.06 Life 111 1026 221 16.97 0.19 PIA 1454 1025 ....

Appel, A. W. 1990. A Runtime System. Lisp and Symbolic Computation 3, 4 (Nov.), 343--380.

....SMLthat addresses these concerns. Standard ML of NJ (SML NJ) is a publicly available implementation of SML developed by Dave MacQueen and Andrew Appel, with contributions from a number of other people [AM87] It runs on a variety of UNIX based systemsand has a highly portable run time system [Appel90] . SML NJ supports first class continuations as an extension [DHM] Our mechanism treats asynchronous signals as continuation producing operations. A signal handler is a function from continuations to continuations: it takes take the current continuation at the time of the signal and returns ....

....Following a quick introduction to the SML NJ run time system, we describe the implementation bottom up. Then there is a discussion of the implementation of robust I O, followed by some performance measurements. 5. 1 The SML NJ run time system The SML NJ run time system is described in [Appel90]) but it has been extensively modified to support signals. We describe the relevant features here. The SML NJ compiler uses continuation passing style (CPS) code generation [AJ89] Unlike other CPS based compilers ( KKR 86] for example) SML NJ has no run time stack; the function return ....

Appel, A.W. "A runtime system," to appear in the Journal of Lisp and Symbolic Computation, 1990.

No context found.

Andrew W. Appel, 1990. A runtime system. Lisp and Symbolic Computation, 3:343--380.

No context found.

Appel, A.W. "A Runtime System". Lisp & Symbolic Comput. 3,4 (Nov. 1990), 343-380.

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