A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We revisit the optimal code generation or evaluation order determination problem -the problem of generating an instruction sequence from a data dependence graph (DDG). In particular, we are interested in generating an instruction sequence Ë that is optimal in terms of the number of registers used by the sequence Ë . We call this MRIS (Minimum Register Instruction Sequence) problem. We developed an efficient heuristic solution for the MRIS problem based on the notion of instruction lineage. Thisdoi:10.1109/ipdps.2001.924962 dblp:conf/ipps/GovindarajanYZAG01 fatcat:ilxvwgvk4ncr5fhvjxspkcut3e