We explore the ramifications of object residency assumptions and their impact on residency checking for several subroutine dispatch scenarios: procedural, static object-oriented, and dynamic (virtual) object-oriented. We obtain dynamic counts of the residency checks necessary for execution of several benchmark persistent programs under each of these scenarios. The results reveal that significant reductions in the number of residency checks can be achieved through application of residency rules derived from the dispatch scenario under which a program executes, as well as additional constraints specific to the language in which it is implemented.
@techreport{Hosking1996TR,
author = {Hosking, Antony L.},
title = {Residency Check Elimination for Object-Oriented Persistent
Languages},
institution = {Purdue University},
year = {1996},
type = {Department of Computer Science Technical Report},
number = {96-053},
month = {September},
url = {http://docs.lib.purdue.edu/cstech/1307}
}