Recursive fork/join parallelism is a parallel version of divide-and-conquer programming. Previous frameworks such as Cilk have demonstrated that fork/join parallelism can be supported in a simultaneously efficient and portable manner via work-stealing task schedulers. These properties also hold in the Java FJTask framework, which adapts ideas from Cilk and related parallel frameworks to Java. This talk will discuss the design and implementation of FJTask, and report on its observed performance on 4 and 30-CPU multiprocessors.
The talk will be based on the paper http://gee.cs.oswego.edu/dl/papers/fj.pdf.
Colloquia Series page.