Benchmark Archaeology
Read OriginalThe article examines a historical performance benchmark from the R mailing list, comparing the speed of R, S, and compiled C code for a loop-intensive statistical algorithm. It revisits the benchmark on modern Apple M1 hardware, showing significant speed gains but less than predicted by Moore's Law, and discusses reasons like single-threaded execution and cache utilization.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
The Beautiful Web
Jens Oliver Meiert
•
2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg
•
1 votes
4
Wagon’s algorithm in Python
John D. Cook
•
1 votes
5
An example conversation with Claude Code
Dumm Zeuch
•
1 votes