Ershov Number

Ershov numbers are used in code optimization to minimize the amount of register allocations. Ershov numbers can be used in methods to optimally select registers when there is only one expression in a code block. Given an expression E = E1 op E2 the goal is to generate code so as to either minimize the number of registers used, or, if an insufficient number of registers is available, to minimize the number of nonregister temporaries required.

The Ershov number n of a node in given expression tree is defined as follows:

  1. Every leaf has n = 1.
  2. For a node with one child, n is the same as child's.
  3. For a node with two children, n is defined as:

The Ershov number of a node represents the minimum number of registers required to evaluate the subexpression whose root is that node. The idea is that we evaluate the child with the larger Ershov number first, then the other child, then perform the operation at the root.

Example

Suppose we have an expression tree with a '+' operation at the root, and the left and right subtrees have Ershov numbers of 3 and 4, respectively. The Ershov number of this node is 4, so we should be able to generate code for the expression using 4 registers.

  1. Generate code to evaluate the right child using registers r1, r2, r3, and r4. Place the result in r1.
  2. Generate code to evaluate the left child using registers r2, r3, and r4. Place the result in r2.
  3. Issue the instruction "ADD r1, r2, r1".

If there are not enough registers available?

If the Ershov number of the root of the expression tree is greater than the number of registers then the Ershov numbers can be used to generate code using a minimal number of loads and stores, as follows:

  1. generate code for the child with the larger Ershov number
  2. issue an instruction to store the result in a temporary
  3. generate code for the child with the smaller Ershov number
  4. issue an instruction to load the temporary into a register
  5. issue an instruction to perform the operation at the root

See also
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.