Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Real Time Ocaml
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-04-20 (00:31)
From: Karl Zilles <zilles@1...>
Subject: Re: [Caml-list] Real Time Ocaml
Brian Hurt wrote:
> The only thing non-realtime in Ocaml is the garbage collection.  There are
> realtime garbage collectors, which do a certain amount of work every
> allocation, so that a) the cost of every allocation is constant (or close
> enough), and b) that all the work the collector ever needs to do is 
> distributed evenly among the allocations.  The current collector, while 
> perfect for non-realtime tasks (due to it's small average cost) is 
> horrible for realtime because of the huge difference between the common 
> case (5 instructions) and the worst case (mass collection)>

In a realtime garbage collector, how can you prove that you are freeing 
unused memory as fast as you allocate it?  In your attempt to put a 
boundry on time, doesn't it open up the possiblility that you might run 
out of space (even if your program has constant memory usage).

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: