Processor oblivious parallel algorithms with provable performances: applications
Interactive Parallel Computation in Support of Research in Algebra, Geometry and Number Theory
January 28,2007 11:30 AM to 12:30 PM
Speakers:
Roch, Jean-Louis
|
 |
Abstract: |
Based on a work-stealing schedule, the on-line coupling of two algorithms (one sequential; the other one recursive parallel and fine grain) enables the design of programs that scale with provable performances on various parallel architectures, from multi-core machines to heterogeneous grids, including processors with changing speeds. After presenting a generic scheme and framework, on top of the middleware KAAPI/Athapascan that efficiently supports work-stealing, we present practical applications such as: prefix computation, real time 3D-reconstruction, Chinese remainder modular lifting with early termination, data compression. |
|
|
