Share This Author
Compilers: Principles, Techniques, and Tools
This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.
Compilers: Principles, Techniques, and Tools (2nd Edition)
The Complexity of Flowshop and Jobshop Scheduling
The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
Complete register allocation problems
- R. Sethi
- Computer ScienceSIAM J. Comput.
- 30 April 1973
It is shown that several variants of the register allocation problem for straight line programs are polynomial complete, and the case when each value is computed exactly once, and when values may be recomputed as necessary.
From Regular Expressions to Deterministic Automata
Scheduling independent tasks to reduce mean finishing time
It is shown that the most general mean-finishing-time problem for independent tasks is polynomial complete, and hence unlikely to admit of a non-enumerative solution.
The Generation of Optimal Code for Arithmetic Expressions
It is shown that the algorithms presented here also minimize the number of storage references in the evaluation, and they are shown to take the shortest possible number of instructions.
Variations on the Common Subexpression Problem
Efficient algorithms are described for computing congruence closures in the general case and in the following two special cases to test expression eqmvalence and to test losslessness of joins in relational databases.
An ideal model for recursive polymorphic types
When constants are added to the pure lambda calculus, run-time errors can occur if the constants are used improperly, for example, if an at tempt is made to apply a natural number as if it were a…
A Level Algorithm for Preemptive Scheduling
A level algorithm is given that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors available, and an upper bound on its performance is derived in terms of the speeds of the processors.