Subject: |
Re: [Haskell-cafe] Boxed Mutable Arrays |
---|---|

From: |
Edward Kmett |

Date: |
Wed, 16 Dec 2009 13:00:12 -0500 |

On Tue, Dec 15, 2009 at 12:00 PM, Gregory Collins <[email protected]> wrote:
This will depend very much on usage patterns and array size. As that array size approaches the size of available memory the difference becomes enormous. Then any single entry mutation forces a linear scan of all of memory. With a two-tier design you only scan a square root of that. I ran benchmarks on a similar hack a year or two ago. Since the difference is asymptotic, you can make it as large of a percentage as you want just by using a bigger hash table/array. I would hazard that your test case wasn't large enough to see the problem at its worst, or your costs were dominated by other factors than GC. -Edward Kmett _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe |

Previous by Date: | Re: [Haskell-cafe] Design question, Sean Leather |
---|---|

Next by Date: | [Haskell-cafe] parallel and distributed haskell?, Scott A. Waterman |

Previous by Thread: | Re: [Haskell-cafe] Boxed Mutable Arrays, Brad Larsen |

Next by Thread: | Re: [Haskell-cafe] Boxed Mutable Arrays, Roman Leshchinskiy |

Indexes: | [Date]
[Thread]
[Top]
[All Lists] |