Advertisement

Using Mathematics to Improve Ada Compiled Code

  • Ward Douglas Maurer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4006)

Abstract

We have developed two mathematical techniques which, used together, can increase the speed of Ada compiled code, in two ways. We can eliminate most subprogram call overhead, involving stack pointer adjustment when a subprogram is called and when it returns. We can also eliminate most static scoping overhead, requiring the use of multiple base registers when procedures are nested. In particular, all this overhead can be eliminated in the absence of recursion. One of our techniques is based on an analogy with a variant of the well-known critical path method. The other is based on a new result in directed graph theory, which has many potential applications in addition to the one presented here.

Keywords

Entry Point Base Register Return Address Simple Cycle Call Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Sebesta, R.W.: Concepts of Programming Languages, 7th edn. Addison-Wesley, Boston (2005)Google Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)MATHGoogle Scholar
  3. 3.
    Ryder, B.G.: Constructing the Call Graph of a Program. IEEE Trans. on Software Eng. 1, 216–226 (1979)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Maurer, W.D.: Loop Trees for Directed Graphs and Their Applications. Technical Report TR-GWU-CS-05-004. Computer Science Dept., George Washington Univ., Washington (2005)Google Scholar
  5. 5.
    Hecht, M.S., Ullman, J.D.: Flow Graph Reducibility. SIAM J. on Computing 1, 188–202 (1972)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    Gabow, H.N.: Path-Based Depth-First Search for Strong and Biconnected Components. Inf. Processing Letters 74, 107–114 (2000)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ward Douglas Maurer
    • 1
  1. 1.Computer Science DepartmentGeorge Washington UniversityWashingtonUSA

Personalised recommendations