[Haskell-cafe] Data.Array.Storable vs GC
David F. Place
d at vidplace.com
Tue Nov 25 09:50:18 EST 2008
On Tue, 2008-11-25 at 17:32 +0300, Bulat Ziganshin wrote:
> Hello David,
> Tuesday, November 25, 2008, 5:27:51 PM, you wrote:
> > When I was researching how to do this, I was really hoping for something
> > like "static areas" from the Lisp Machine operating system. You could
> > allocate any normal object in an area of the heap where the GC would not
> > bother with it. I miss that. I wonder why GHC doesn't have such a
> > concept?
> it has. bytestrings use this area, it's called "pinned arrays"
Thanks. I'll look into it. BTW, running my program with the compacting
GC improved efficiency dramatically. Your initial idea that it was my
other data was my other data was absolutely correct.
More information about the Haskell-Cafe