/explore
|
You are here 
|
github.com | ||
| | | | |
sigpwned.com
This is the first post in a three-post series covering the fundamentals of software optimization. You can find the introduction here. You can find Part II here. You can find the companion GitHub repository here. The introduction motivated why software optimization is a problem that matters, reflected on the fundamental connection between the scientific method |
|
| | | | | ||
| | | | |
richardstartin.github.io
I was encouraged to find out recently that many operations on byte[] can now be vectorised by C2 starting in JDK13. These improvements come from a long line of contributions from Intel to improve C2's use of AVX+ instructions, which have the potential of speeding up a lot of Java programs running on x86. Naturally, I am keen to find out how big an impact this can have in an ideal situation, but also compare the simple routines with older, harder to get right, alternatives using Unsafe. |
|
| | | | | ||
| | | | |
bruun.co
The bottleneck in modern server software has moved back to the code. This forces us to make sure that our code is fast enough - the hayai framework provides a convenient solution to that problem. |
|
| | | | | ||
| | | | |
www.abubalay.com
[AI summary] The article explains the concepts of recursive descent and LR parsing while deriving practical parsing techniques like Pratt parsing from automaton theoretical foundations. |
|
| | | |||
