The Flying Frog Blog

I just stumbled upon an interesting benchmark. Put mappings i -> i for i in 1..10M in a hash table, print the entry for 100. Don Stewart's o...

Our recent post about the merits of accurate garbage collection over reference counting prompted Tezka to ask for measurements demonstratin...

In this era of multicore computing, garbage collectors need to allow user threads (aka mutators ) to run in parallel on separate cores simul...

After over 3 years, The OCaml Journal is finally closing down. New subscriptions offer access to the 75 existing articles and only a few mo...

Mono 2.2 was recently shipped and a new JIT code generator was the main selling point promoted by the Mono project because it provides the ...

How fast are hash tables in Mono 2.4 compared to .NET 4? An excellent question but one which led us to another trivial program that leaks me...

Purely functional data structures have the following advantages: Persistence: old versions can be reused safe in the knowledge that they ca...

In a recent interview about Scala and Clojure, Martin Odersky of Scala gave some interesting answers including the following: Q: Rich Hick...

Our initial experiments using the new garbage collector design indicate that it dramatically improves the performance of the slowest GC phas...

Many applications require the ability to churn through gigabytes of data. In such cases, high IO throughput is valuable. This article examin...