On Thu, Dec 24, 2009 at 11:38 PM, Roman Cheplyaka r...@ro-che.info wrote:
So, let's think what we can do at runtime. Suppose RTS takes the parameter --
upper limit of consumed memory. When it sees that memory consumption is
close to upper bound, it can:
1. force garbage collection
This is
On Fri, Dec 25, 2009 at 5:14 AM, Svein Ove Aas svein@aas.no wrote:
On Thu, Dec 24, 2009 at 11:38 PM, Roman Cheplyaka r...@ro-che.info wrote:
So, let's think what we can do at runtime. Suppose RTS takes the parameter --
upper limit of consumed memory. When it sees that memory consumption is
Am Freitag 25 Dezember 2009 15:45:29 schrieb Gwern Branwen:
On Fri, Dec 25, 2009 at 5:14 AM, Svein Ove Aas svein@aas.no wrote:
On Thu, Dec 24, 2009 at 11:38 PM, Roman Cheplyaka r...@ro-che.info wrote:
So, let's think what we can do at runtime. Suppose RTS takes the
parameter -- upper
Imagine some system with hard memory bound (e.g. 64M of physical memory,
no swap). I don't want some accidental laziness (maybe even not in my
code, but in some used package) to crash my program.
So, let's think what we can do at runtime. Suppose RTS takes the parameter --
upper limit of consumed
This is a problem with partitioned operating systems used in avionics. The
airplane computers require certain partitions to exist between programs in
both time and space. The space guarantees are most easily enforced by
eliminating any dynamic memory allocation once the operating system enters a
