The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
P-Complete Approximation Problems
Journal of the ACM (JACM)
Assembling code for machines with span-dependent instructions
Communications of the ACM
A process for the determination of addresses in variable length addressing
Communications of the ACM
How to keep the addresses short
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design of an Optimizing Compiler
The Design of an Optimizing Compiler
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Chaining Span-Dependent Jump Instructions
ACM Transactions on Programming Languages and Systems (TOPLAS)
An implementation of a code generator specification language for table driven code generators
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
| Hi-index | 0.00 |
Many machine languages have two instruction formats, one of which allows addressing of “nearby” operands with “short” (e.g. one word) instructions, while “faraway” operands require “long” format (e.g. two words). Because the distance between an instruction and its operand depends upon the formats of the intervening instructions, the formats of different instructions may be interdependent.An efficient technique is discussed which optimally assigns formats to instructions in a given program and is practical in space as well as time. The more sophisticated problem of arranging operands within programs is discussed. Unfortunately, it is unlikely that an efficient algorithm can guarantee even a good approximation for this problem, since it is shown that r-approximation is NP-complete.Finally, implications of these problems for hardware and software design are considered.