Re:Conservative GC can be faster than precise GC
by 10000truths on Saturday September 07, 2024 @02:00PM
(#41475297)
There is a plethora of information regarding instruction timings, throughout/latency, execution port usage, etc. that compilers make liberal use of for optimization purposes. You could, in theory, also use that information to establish an upper bound on how long a series of instructions would take to execute. The problem lies in the difference in magnitude between average case and worst case, due to dynamic execution state like CPU cache, branch prediction, kernel scheduling, and so on.
[ Parent
| on HN ]
Re:Conservative GC can be faster than precise GC
by Mathnerd314 on Sunday September 08, 2024 @12:51AM
(#41478275)
There is uiCA, it achieves an error of about 1% relative to actual measurements of basic block throughput across a wide range of microarchitectures. And then FACILE, similar to uiCA. I don't know of any compilers using these more accurate models, but it is certainly possible.