This paper describes a performance prediction model of parallel mark-sweep garbage collectors (GC) on shared memory multiprocessors. The prediction model.
The effect of automatic regulation of GC parallelism is shown, which accurately predicts qualitatively different speedups on the two machines that occurred ...
A scalable mark-sweep garbage collector on large-scale shared-memory machines. In Proceedings of ACM/IEEE Conference on High Performance Networking and ...
This paper describes a performance prediction model of parallel mark-sweep garbage collectors (GC) on shared memory multiprocessors.
Figure 3 presents our results in terms of scalability graphs. The x-axis is the number of processors. The y-axis shows speedup relative to the performance of.
Missing: Predicting | Show results with:Predicting
Endo, T., Taura, K. and Yonezawa, A.: Predicting Scalability of Parallel Garbage Collectors on Shared Memory Multiprocossors, Proceedings of International ...
In PARSAC-2, parallelism is based on multiple threads (lightweight processes) executing on a shared memory multiprocessor. The S-threads subsystem provides ...
Our parallel collectors use this framework to balance the work of root scanning, using static overpartitioning, and also to balance the work of tracing the ...
Predicting Scalability of Parallel Garbage Collectors on Shared Memory Multiprocessors pp. 10043a. On the Exploitation of V lue Prediction and Producer ...
This paper investigates the scalability of parallel heap tracing, which stands at the core of the garbage collection activity, and proposes and implements a ...