Building a Control-flow Graph from Scheduled Assembly Code

  title={Building a Control-flow Graph from Scheduled Assembly Code},
  author={Keith D. Cooper and Timothy J. Harvey and Todd Waterman},
A variety of applications have arisen where it is worthwhile to apply code optimizations directly to the machine code (or assembly code) produced by a compiler. These include link-time whole-program analysis and optimization, code compression, binary-to-binary translation, and bit-transition reduction (for power). Many, if not most, optimizations assume the presence of a control-flow graph (cfg). Compiled, scheduled code has properties that can make cfg construction more complex than it is… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
21 Citations
37 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 21 extracted citations


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

Sweany and S . J . Beatty . Dominator - path schedule — a global scheduling method

  • H Philip
  • The Java HotSpot Virtual Machine
  • 2001

Post - compilation analysis and power reduction

  • Todd Waterman
  • 2000

Private communication. Several discussions related to the TMS320C6xxx ISA and the code produced by Texas Instruments

  • Reid Tatge
  • compiler for those processors.,
  • 2000
1 Excerpt

The SPARC Architecture Manual, Version 9

  • Daniel L. Weaver, Tom Germond, editors
  • PTR Prentice-Hall,
  • 2000

The GRID: Blueprint for a New Computational Infrastructure

  • Ian Foster, Carl Kesselman
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…