Controlled Node Splitting

@inproceedings{Janssen1996ControlledNS,
  title={Controlled Node Splitting},
  author={Johan Janssen and Henk Corporaal},
  booktitle={CC},
  year={1996}
}
To exploit instruction level parallelism in programs over multiple basic blocks, programs should have reducible control flow graphs. However not all programs satisfy this property. A new method, called Controlled Node Splitting (CNS), for transforming irreducible control flow graphs to reducible control flow graphs is presented. CNS duplicates nodes of the control flow graph to obtain reducible control flow graphs. CNS results in a minimum number of splits and a minimum number of duplicates… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Ryder and Marvin C . Paull . Elimination algorithms for data flow analysis

  • Ana M. Erosa, Laurie J. Hendren
  • ACM Computing Surveys
  • 1986