The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
With the advent of multicore processors, it has become imperative to write parallel programs if one wishes to exploit the next generation of processors. This paper deals with skyli...
Sungwoo Park, Taekyung Kim, Jonghyun Park, Jinha K...
The three mechanisms of crossover are transmission, assortment, and respect. Of these three mechanisms, assortment (i.e. recombination) is traditionally viewed as the primary feat...
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...