More evidence that garbage collection is expensive

As seen on Lambda the

Quantifying the Performance of Garbage Collection vs. Explicit Memory Management

We compare explicit memory management to both copying and non-copying garbage collectors across a range of benchmarks, and include real (non-simulated) runs that validate our results. These results quantify the time-space tradeoff of garbage collection: with five times as much memory, an Appel-style generational garbage collector with a non-copying mature space matches the performance of explicit memory management. With only three times as much memory, it runs on average 17% slower than explicit memory management. However, with only twice as much memory, garbage collection degrades performance by nearly 70%. When physical memory is scarce, paging causes garbage collection to run an order of magnitude slower than explicit memory management.


Popular posts from this blog

GLES Quake - a port of Quake to the Android platform

Using a Mac keyboard with Ubuntu Linux

A Taipei-Torrent postmortem: Writing a BitTorrent client in Go