The Version table provides details related to the release that this issue/RFE will be addressed.
Unresolved : Release in which this issue/RFE will be addressed. Resolved: Release in which this issue/RFE has been resolved. Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availability Release.
The search functions in the BitMap class could use alternative methods to locate the next one bit instead of the simple for loop currently implemented.
Comments
Related paper:
Kazuya Morikawa, Tomoharu Ugawa, and Hideya Iwasaki. 2013. Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector. In Proceedings of the 2013 international symposium on memory management (ISMM '13). ACM, New York, NY, USA, 15-26. DOI=10.1145/2464157.2466480 http://doi.acm.org/10.1145/2464157.2466480
15-07-2014
EVALUATION
One user reported noticeable speedups of parallel compaction, which uses bitmap searches heavily, after implementing search using table lookup.