| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 14
reviews
|
|
|
 |
|
|
|
|
The case for virtual register machines
Gregg D., Beatty A., Casey K., Davis B., Nisbet A. Science of Computer Programming 57(3): 319-338, 2005. Type: Article
Gregg et al. present results indicating that it might be more efficient to implement a Java Virtual Machine (JVM) by translating the bytecode instructions from a stack-based instruction set to a register-based set. To test their ideas,...
|
May 21 2007 |
|
|
|
|
|
|
A nanopass infrastructure for compiler education
Sarkar D., Waddell O., Dybvig R. ACM SIGPLAN Notices 39(9): 201-212, 2004. Type: Article
Sarkar, Waddell, and Dybvig present their solution to the problem of how to implement a compiler project in a classroom. The general problem is that compilers are usually constructed to be of a few passes, and each pass is relatively c...
|
Oct 29 2004 |
|
|
|
|
|
|
Object-oriented tree traversal with J. J. Forester
Kuipers T., Visser J. Science of Computer Programming 47(1): 59-87, 2003. Type: Article
The authors present a well-organized description of the JJForester tool for performing parse tree traversals. Their basic goal is to provide a practical parsing tool based on algebraic syntax formalism (ASF) and syntax definition forma...
|
May 9 2003 |
|
|
|
|
|
|
Learning the Unix operating system: a concise guide for the new user (5th ed.)
Peek J., Todino G., Strang J., O’Reilly & Associates, Inc., Sebastopol, CA, 2001. 157 pp. Type: Book (9780596002619)
Peek, Todino, and Strang have revised a classic book on Unix in this fifth edition. The original volume was published in 1977, and has long been a worthy resource for people learning Unix. The intent of the book is to be concise, but ...
|
Nov 14 2002 |
|
|
|
|
|
|
BURS automata generation
Proebsting T. ACM Transactions on Programming Languages and Systems 17(3): 461-486, 1995. Type: Article
The author describes a simple, efficient algorithm to generate bottom-up rewrite system (BURS) tables. A BURS table can be used in a code generator to select optimal instructions efficiently. Efficiency is achieved because the dynamic ...
|
Sep 1 1996 |
|
|
|
|
|
|
Static analysis of upper and lower bounds on dependences and parallelism
Pugh W., Wonnacott D. ACM Transactions on Programming Languages and Systems 16(4): 1248-1278, 1994. Type: Article
The authors present a two-step approach to searching source code for possible parallelism. The basic problem is to accurately compute array data dependences. Existing compilers employ conservative algorithms and sometimes fail to detec...
|
Jan 1 1996 |
|
|
|
|
|
|
Program optimization and parallelization using idioms
Pinter S., Pinter R. ACM Transactions on Programming Languages and Systems 16(3): 305-327, 1994. Type: Article
The authors present a new translation technique for automatic parallelization based on recognition of “idioms” (standard constructs such as reductions and scans). Their technique consists of transforming all loops i...
|
Jun 1 1995 |
|
|
|
|
|
|
What’s in a region?
Ball T. ACM Letters on Programming Languages and Systems 2(1-4): 1-16, 1993. Type: Article
The author presents new definitions for weak and strong regions in a control-flow graph and presents nearly-linear-time algorithms for computing these regions. Computing strong regions is important in code scheduling, permitting moveme...
|
Feb 1 1995 |
|
|
|
|
|
|
Abstract description of pointer data structures: an approach for improving the analysis and optimization of imperative programs
Hummel J., Hendren L., Nicolau A. ACM Letters on Programming Languages and Systems 1(3): 243-260, 1992. Type: Article
The authors discuss the inherent difficulties in optimizing programs with pointer data structures and present a mechanism for augmenting the syntax for pointer variable declarations with useful descriptive information. The primary prob...
|
Dec 1 1994 |
|
|
|
|
|
|
Lifetime-sensitive modulo scheduling
Huff R. ACM SIGPLAN Notices 28(6): 258-267, 1993. Type: Article
The author presents the concept of bidirectional slack-scheduling to improve the efficiency of register allocation for loops. Basically, he presents heuristics for determining whether to attempt to schedule an operation as early as pos...
|
Mar 1 1994 |
|
|
|
|
|
| |
|
|
| |
|
|
