I really think it could be someone's thesis to make useful, but right now I'm just worried about assuring predictability.
If you can say it has a quadratic performance, then you can predict the garbage collection execution time (e.g. you can consider it always has quadratic time). Using this time and taking into account other variables, developers can determine a worst case execution time for each one of their applications, and that is hard real time, even if it's not high performance. So, are these corner cases predictable?
The links you guys mentioned are really helping. Thank you all!
On Tue, Oct 26, 2010 at 11:47 AM, Juris Kalnins
<juris@mt.lv> wrote:
On Tue, 26 Oct 2010 16:02:40 +0300, Paul Hudson <
phudson@pobox.com> wrote:
I worked for a company where we built a Lisp implementation with a hard
upper limit on GC pauses... (I wasn't involved, so I don't know the details,
put an upper limit on it's pauses...
Lua GC has all kinds of corner cases (such as quadratic worst case performance
of the ephemeron collection) that make it extremely unlikely to be useful for
*hard* real-time usage.
