|Subject:||Re: [Haskell-cafe] Memory-aware Haskell?|
|From:||John Van Enk|
|Date:||Thu, 24 Dec 2009 17:46:30 -0500|
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 'normal mode'. This means that all memory needs to be allocated on the stack and ahead of time.
This reduces the calculation of the upper memory bound to checking what the largest possible stack a process could grow to is. Of course, calculating this maximum stack is difficult in its own right.
Unfortunately, nothing I've just discussed seems to port well to Haskell (I could be wrong!). Given this, I think you're looking at a very hard problem (but one I'd be incredibly interested in discovering a solution for!).
On Thu, Dec 24, 2009 at 5:38 PM, Roman Cheplyaka <[email protected]> wrote:
Imagine some system with hard memory bound (e.g. 64M of physical memory,
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
|<Prev in Thread]||Current Thread||[Next in Thread>|
|Previous by Date:||[Haskell-cafe] Memory-aware Haskell?, Roman Cheplyaka|
|Next by Date:||Re: [Haskell-cafe] Haskell Users in Leipzig, Matthias-Christian Ott|
|Previous by Thread:||[Haskell-cafe] Memory-aware Haskell?, Roman Cheplyaka|
|Next by Thread:||Re: [Haskell-cafe] Memory-aware Haskell?, Svein Ove Aas|
|Indexes:||[Date] [Thread] [Top] [All Lists]|