4 ms·
To get full protection also against dangling pointers to deallocated objects ("temporal safety"), a service similar not too unlike a garbage collector would hav
by Findecanor 5y ago
To get full protection also against dangling pointers to deallocated objects ("temporal safety"), a service similar not too unlike a garbage collector would have to be used.
Several algorithms have been developed, and the best of those have had an average runtime overhead of around 5% in benchmarks of algorithms, but in some benchmarks the overhead has been over 25%. Then there is overhead for memory that has yet to be cleared for reuse.
I haven't seen any benchmark of any real application. (I might just have missed it though)