Static grouping of small objects to enhance performance of a paged virtual memory
ACM Transactions on Computer Systems (TOCS)
Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
Systematic software development using VDM
Systematic software development using VDM
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
Multiprocessing compactifying garbage collection
Communications of the ACM
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Use Bit Scanning in Replacement Decisions
IEEE Transactions on Computers
Some issues and strategies in heap management and memory hierarchies
ACM SIGPLAN Notices
ACM SIGARCH Computer Architecture News
An adaptive load balancing method in the computational field model
OOPSLA/ECOOP '90 Proceedings of the workshop on Object-based concurrent programming
A performance evaluation on caching mechanisms for a persistent object system
ACM SIGPLAN OOPS Messenger
| Hi-index | 0.00 |
Object oriented programming environments frequently suffer serious performance degradation because of a high level of paging activity when implemented using a conventional virtual memory system. Although the fine-grained, persistent nature of objects in such environments is not conducive to efficient paging, the performance degradation can be limited by careful grouping of objects within pages. Such object placement schemes can be classified into four categories -- the grouping mechanism may be either static or dynamic and may use information acquired from static or dynamic properties. This paper investigates the effectiveness of a simple dynamic grouping strategy based on dynamic behaviour and compares it with a static grouping scheme based on static properties. These schemes are also compared with near-optimal and random cases.