Category Archives: Parallelism

When you practice sequential programming, you learn rules of thumb to identify and avoid patterns that lead to disastrous performance. The same is true for parallel programming. Here are some lessons inspired by the feedback we received from first-time users … Continue reading →

An explicit parallel composition operator (Ateji PX‘s parallel bar) is pretty useful for hybrid CPU-GPU programming. All frameworks I know embed GPU code into some sort of method call, sometimes indirectly. In any case, you end up writing something like … Continue reading →

It is common wisdom that programming with Java threads is difficult (and even more so in other languages). But have you ever tried to figure precisely why this is so ? The problem with threads (PDF) is a nicely written … Continue reading →

When presenting Ateji PX to an audience with HPC or simulation background, I often hear definitive opinions of the kind “We’ll never consider Java, it’s too slow”. This appears to be more a cultural bias than an objective statement referring … Continue reading →

We have put online an Ateji PX version of the Mandelbrot set demo. You specify the number of processor cores to be used for the computation using a slider (lower right), ranging from 1 to the number of available cores … Continue reading →

A simple way of computing the constant π (pi) consists in measuring the surface under a curve. In more algebraic terms, this amounts to integrating y = 4/(1+x*x) between 0 and 1, and in programming terms this means incrementing x … Continue reading →

A gentle introduction to Ateji PX is available as a white-paper. It covers all new language constructs, and will definitely give you food for thought if you’ve ever had a look at the existing multi-core programming techniques. Download it here … Continue reading →