Set Covering by an All Integer Algorithm: Computational Experience
Journal of the ACM (JACM)
How to keep the addresses short
Communications of the ACM
Code Generation and Storage Allocation for Machines with Span-Dependent Instructions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Assembling code for machines with span-dependent instructions
Communications of the ACM
| Hi-index | 48.23 |
An algorithm is presented for the assignment of instruction addresses and formats under the following conditions: (1) the length of the instruction varies as a function of the distance of the instruction from its target; (2) there exists an optimality criterion which implies some preferential choices subject to the addressing constraints. This may be, for example, achieving the smallest number of long instructions, in which case the total code length is minimized, or minimizing the assigned address of a specified point in the program. The algorithm is suitable for arbitrary program structure and a choice of optimization criteria.