Abstract
We explore !.he ramifications ofobjectresidency 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 ofseveral benchmark persistent programs
under each of these scenarios. The resuhs reveal that significant reductions in the number of residency checks
can be achieved through application of residency rules derived from lhe dispatch scenario under which a program executes, as well as additional constraints specific lo the language in which it is implemented.
subroutine dispatch scenarios: procedural, static object-oriented, and dynamic (virtual) object-oriented. We obtain dynamic counts of the residency checks necessary for execution ofseveral benchmark persistent programs
under each of these scenarios. The resuhs reveal that significant reductions in the number of residency checks
can be achieved through application of residency rules derived from lhe dispatch scenario under which a program executes, as well as additional constraints specific lo the language in which it is implemented.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 7th Workshop on Persistent Object Systems |
| Editors | Richard Connor, Scott Nettles |
| Publisher | Morgan Kauffman Publishers |
| Pages | 174-183 |
| ISBN (Print) | 1-55860-447-2 |
| Publication status | Published - 1996 |
| Externally published | Yes |