|
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. | |
| | | | |
psy-lob-saw.blogspot.com
|
|
| | | | | Get started with JMH, a new Java Micro-Benchmarking framework | |
| | | | |
without.boats
|
|
| | | [AI summary] The post explains the overview and implementation of a tracing garbage collector in Rust, specifically within the Shifgrethor project, covering concepts like rooted memory, mark-and-sweep phases, and linked list structures. | ||