S. Debray, R. Muth, and S. Watterson. Link-time Improvement of Scheme Programs. In Proc. 8th International Conference on Compiler Construction (CC'99), pages 76-90, Mars 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
GOld: a link-time optimizer for Scheme - Boucher (2000) (Correct)
.... to see how the constraint minimization algorithms could be used to optimize our analysis programs (either at abstract compilation time or at global analysis time, using just in time compilation) For procedural languages, there are a number of systems optimizing object code at link time [11, 10, 29, 30]. The work of Wall [30] is mainly concerned with the global allocation of registers at link time. The system rst compiles each module individually to object code, with certain instructions carefully annotated. These annotations indicate how the operands and the results of the annotated ....
....These systems do not compile the modules to object code, though. They implement more sophisticated architectures. However, we argue that object code is a too low level program representation for performing cross module optimizations of higher order, dynamic languages. For instance, the alto system[11, 10] that performs several cross module optimizations is only able to speed up Scheme programs generated by Gambit C by 10 on the average. Finally, Fern andez [14] developed mld, a link time optimizer for Modula 3 and C . This system performs simple optimizations resembling partial evaluation like ....
S. Debray, R. Muth, and S. Watterson. Link-time Improvement of Scheme Programs. In Proc. 8th International Conference on Compiler Construction (CC'99), pages 76-90, Mars 1999.
alto: A Link-Time Optimizer for the DEC Alpha - Muth, Debray, Watterson (1998) (9 citations) Self-citation (Debray Muth Watterson) (Correct)
....carried out using C benchmarks, we wanted to evaluate its effect on code generated from source programs in very different languages. To this end, we also tested it on a set of Prolog and Scheme programs, whose low level dynamic characteristics are considerably different from those of C programs [12]. These are both dynamically typed languages, which means that, unlike C, there is extensive low level pointer arithmetic to add and remove tag bits that are used to attach type information to pointers. Further, the presence of garbage collection induces a greater proportion of memory references ....
S. K. Debray, R. Muth, and S. Watterson, "Link-Time Improvement of Scheme Programs", Proc. 8th. International Conference on Compiler Construction (CC'99), March 1999 (to appear).
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