SC Conference - Activity Details

Noman Javed  (University of Orléans)

Frédéric Loulergue  (University of Orléans)

Tuesday,  05:15PM - 07:00PM

Room Rotunda Lobby

The existing solutions to program parallel architectures range from parallelizing compilers to distributed concurrent programming (with MPI). Intermediate approaches propose a more structured parallelism: Algorithmic skeletons are higher-order function that capture the patterns of a parallel algorithms such as pipeline, reduction, etc. The user of the library has just to compose some of the skeletons to write her parallel application. When one is designing a parallel program, the parallel performance is important. It is thus very interesting for the programmer to rely on a simple yet realistic parallel performance model such as the Bulk Synchronous Parallel (BSP) model. We present OSL, the Orléans Skeleton Library: it is a metaprogrammed (for efficiency) library of BSP algorithmic skeletons in C++. It offers data-parallel skeletons on arrays and matrices: map, reduce, scan and zipWith as well as communication oriented skeletons. The performances of OSL are demonstrated with several applications: primes, heat equation, FFT.