an instrumentation framework for building dynamic analysis tools. Includes a memory error detector, two thread error detectors, a cache and branch-prediction profiler, a call-graph generating cache profiler, and a heap profiler. It also includes two experimental tools: a heap/stack/global array overrun detector, and a SimPoint basic block vector generator.
I just saw this page comparing the performance of several languages on a simple Mandelbrot set generator. His numbers show Java being over twice as slow as C, but then I noticed that he's using an older version of java and only running the test once, whic
I've always enjoyed fractals, and was curious if scripting languages were up to the task. I wrote a very simple Mandelbrot set generator for my test. Rather than optimizing for each language, I tried to write each program in approximately the same way in
The goal of this project is to provide a comparison of the existing open-source and commercial (when available for free evaluation download) libraries for binding XML data to Java classes. The libraries are evaluated in several areas, including ease of use (the amount of effort needed to invest to the first successful run), the size of the accompanying jar files and the performance. In this project, the main emphasis is put into providing the performance comparisons, both in time and in memory. For various aspects of XML binding you can visit this link (courtesy of Ronald Bourret).