Comment by IAmRinSlow 13 hours ago Is it 100% deterministic? 2 comments IAmRinSlow Reply laginimaineb 12 hours ago The verification is, which allows the optimisation to be extremely broad and non deterministic.It's really unlike a compiler. For example, for a function like 'sort', the optimisation can:- Use quicksort if the data distribution is generic.- Use insertion sort if the data is nearly sortedAnd so on... As long as these can be proven sound, Maxwell can pick the best optimisation in real time. ch_sm 7 hours ago How does it prove the performance improvement? Does it A/B test in place on a production app?
laginimaineb 12 hours ago The verification is, which allows the optimisation to be extremely broad and non deterministic.It's really unlike a compiler. For example, for a function like 'sort', the optimisation can:- Use quicksort if the data distribution is generic.- Use insertion sort if the data is nearly sortedAnd so on... As long as these can be proven sound, Maxwell can pick the best optimisation in real time. ch_sm 7 hours ago How does it prove the performance improvement? Does it A/B test in place on a production app?
ch_sm 7 hours ago How does it prove the performance improvement? Does it A/B test in place on a production app?
The verification is, which allows the optimisation to be extremely broad and non deterministic.
It's really unlike a compiler. For example, for a function like 'sort', the optimisation can:
- Use quicksort if the data distribution is generic.
- Use insertion sort if the data is nearly sorted
And so on... As long as these can be proven sound, Maxwell can pick the best optimisation in real time.
How does it prove the performance improvement? Does it A/B test in place on a production app?