The Advantages of Machine-Dependent Global Optimization (1994)
| Venue: | In Proceedings of the 1994 Conference on Programming Languages and Systems Architectures |
| Citations: | 41 - 17 self |
BibTeX
@INPROCEEDINGS{Benitez94theadvantages,
author = {Manuel Benitez and Jack W. Davidson},
title = {The Advantages of Machine-Dependent Global Optimization},
booktitle = {In Proceedings of the 1994 Conference on Programming Languages and Systems Architectures},
year = {1994},
pages = {105--124},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
machine designers have long recognized this dilemma. In 1972, Newey, Poole, and Waite [Newe79] observed that `Most problems will suggest a number of specialized operations which could possibly be implemented quite efficiently on certain hardware. The designer must balance the convenience and utility of these operations against the increased difficulty of implementing an abstract machine with a rich and varied instruction set.' Fortunately, applying all code improvements to the LIL removes efficiency considerations as HIL design issue. The abstract machine need only contain a set of features roughly equivalent to the intersection of the operations included in typical target machines. The result is a small, simple abstract machine. Such abstract machines are termed `intersection' machines. The analogy between union/intersection abstract machines and CISC/RISC architectures is obvious. void daxpy(n, da, dx, incx, dy, incy) int n, incx, incy; double da, dx[], dy[]; { if (n <= 0) return; i...
