[Date Prev][Date Next][Thread Prev][Thread Next]
[Date Index]
[Thread Index]
- Subject: LuaChip and GC
- From: "Michael T. Richter" <mtr1966@...>
- Date: Wed, 11 Aug 2004 11:06:15 +0800
It's been asserted that there is no real-time solution to garbage collection
here at a theoretical level. Wasn't Baker's Treadmill a real-time version
of the tri-colour abstraction? I know that it has a couple of performance
problems in its naive implementation, but I thought there were plausible
optimisations of it that rendered it worthwhile.
If a Baker's Treadmill will work, and if the allocator/GC in Lua is
sufficiently abstract in its implementation that you could plug a new
allocator/GC system in its place, perhaps a Baker's Treadmill could be used
in LuaChip to give the hard timing bounds needed for that system.