Remix.run Logo
▲ pjmlp 3 hours ago

Then you never embedded development with real time JVMs, for example.

▲hashmash 3 hours ago | parent [-]

Nope. What kind of collectors do they use to be real time? I've never understood how this is possible.

▲pjmlp an hour ago | parent | next [-]

Real time algorithms, plenty of material on the matter.

Here is the book on the first implementation that was on the genesis of Aicas JamaicaVM.

https://www.amazon.com/dp/3831138931/ref=mp_s_a_1_1

▲pron an hour ago | parent | prev [-]

Even ZGC now offers better predictablity than malloc/free allocators (which are a long way from predictable as far latency goes). But some hard-realtime software uses (or at least used to) RTSJ, a hard-realtime version of Java, that separates the heap to a part that uses a GC and a part that uses nested arenas. It was a big deal twenty years ago, when I worked on such software. I don't know how much it's still used. Probably not much. C is still king in that world, and Ada too, to some extent.

It's important to know that for hard realtime, even C alone isn't enough, though, and you need special kernels. Ordinary OS schedulers aren't predictable enough for hard realtime.