The Price of Relocations

• Relocation processing is the most expensive step.

• It's complexity is asymptotically at least O(rs), where r is the number of relocations and s is the number of symbols defined in all participating objects.

• This clarifies that to maximizes performance one should strive to reduce the number of both relocations and symbols as much as possible.