Mostly parallel garbage collection
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
The ObjectStore database system
Communications of the ACM
The memory fragmentation problem: solved?
Proceedings of the 1st international symposium on Memory management
Communications of the ACM
Communications of the ACM
Dynamic Storage Allocation: A Survey and Critical Review
IWMM '95 Proceedings of the International Workshop on Memory Management
Implementing Garbage Collection in the PerDiS System
Proceedings of the 8th International Workshop on Persistent Object Systems (POS8) and Proceedings of the 3rd International Workshop on Persistence and Java (PJW3): Advances in Persistent Object Systems
New methods for dynamic storage allocation (Fast Fits)
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Larchant: persistence by reachability in distributed shared memory through garbage collection
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Garbage collection and DSM consistency
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
RepWeb: replicated Web with referential integrity
Proceedings of the 2003 ACM symposium on Applied computing
Asynchronous Complete Distributed Garbage Collection
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Server enforced program safety for web application engineering
Journal of Web Engineering
| Hi-index | 0.00 |
This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two different web sites in the store. The evaluation was conducted using (i) a web gathering tool, to log the web objects graph, and (ii) a PerDiS memory simulator that implements the different allocation strategies. Our results show that for all the strategies and parameters we have evaluated, reference and cycle locality are quiet poor. The best policy seems to be first sequential fits. Results are linear with the size of the garbage collection Unit (a bunch). There is no clear optimum, but 64K to 128K appear to be good choices.