2 ms·
Interesting, though that seems to be the same authors so I'm not entirely sure I trust their methodology, given how much they messed it up the first time round.
by IshKebab 4y ago
Interesting, though that seems to be the same authors so I'm not entirely sure I trust their methodology, given how much they messed it up the first time round. Also the results (page 48) show some obvious red flags, e.g. C and Chapel being suspiciously fast on Ackermann.
Still the overall results mostly match my intuition.
- igouy 4y ago> … how much they messed it up the first time round. With exploratory data analysis it is important to state how outliers will be identified and treated. https://www.itl.nist.gov/div898/handbook/prc/section1/prc16.htm https://www.itl.nist.gov/div898/handbook/prc/section1/prc16.... The data tables published with that 2017 paper, show a 15x difference between the measured times of the selected JS and TS fannkuch-redux programs. That should explain the TS and JS average Time difference. There's an order of magnitude difference between the times of the selected C and C++ programs, for one thing — regex-redux. That should explain the C and C++ average Time difference. Even without looking for cause, they seem like outliers which could have been excluded. Without those outliers you'd be telling me that "the overall results mostly match my intuition".