Faster Objects and Arrays
summary
Library code called org.ObjectLayout and StructuredArray presents a structured-array API that is vanilla Java (works on JDK 7+) with JMH tests and a GitHub repo and optional JVM intrinsics for Zing/other JDKs. It claims to recover C-like dead-reckoning and streaming layout benefits for heap objects, exposes contained/container GC support, and shows real results — a hashmap spine port runs 5–12% faster on hashmap get with the structured array approach.
AI-written summary · about
chapters (20)
- 0:00Introduction
- 1:42Gil Tene
- 4:03Object Layout
- 6:53Value Types and Packed Objects
- 8:31Value Types and Heap
- 12:34The Argument
- 16:42Semantics
- 20:07Target Forms
- 21:15Object Layouts
- 22:41Java util Concurrent
- 24:34Array Structure
- 26:21Array Constructor
- 27:43Liveness
- 30:26Benefits
- 31:41Structure
- 36:06Optimizations
- 37:40Intrinsic Objects
- 39:12Subclasses
- 40:04Composability
- 41:33Status
related talks
41mJava 24, Faster Than Ever
40mLudicrous Speed: Designing For Performance on the JVM
16mHeapBuffers: Why not just using a binary serialization format for your managed memory?
02h 50mFunctional Array Funhouse Intensive - Part 3 of 5
14mMemory Optimization through Structure Packaging
56m“High Performance Code 201: Hybrid Data Structures"
51mIn-Memory Computing - The Big Picture
21mMemory Efficient Java