Projects

The team develops a number of projects as proof-of-concept software. From the original research effort started in 1994, aimed at parallelism extraction from sequential source code, or program transformations to express parallelism, our research portfolio has evolved to accommodate the evolution of the High Performance Computing and Distributed Computing.

PolyLib

The Polyhedral Library (PolyLib for short) operates on objects made up of unions of polyhedra of any dimension. It was first developed by Doran Wilde at IRISA, in Rennes, France, in connection with the ALPHA project. This first version (1.1) manipulates non parameterized unions of polyhedra through the following operations: intersection, difference, union, convex hull, simplify, image and preimage, plus some input and output functions. The polyhedra are computed in their dual implicit and Minkowski representations, in homogeneous spaces.

Version 2 of the PolyLib included parameterized vertices computation. PolyLib3.14 includes Ehrhart polynomials computation, which permits to count the number of integer points contained in a parameterized polyhedron. PolyLib4 included the GNU MP library (as a compilation option), and 64 bits computations, in order to avoid integer overflows. Polylib5 is a merge of Strasbourg, Rennes and BYU Polylib.

See dedicated site for more information : http://icps.u-strasbg.fr/polylib

P2P-MPI

P2P-MPI is both an MPJ implementation and a middleware for the management of computing resources. Similar to the idea of sharing files through a P2P system, P2P-MPI lets its users share their CPU and access others’ CPUs. P2P-MPI is oriented to desktop grids: it is runnable as a simple user (no root privilege needed) and provides a transparent mechanism for fault-tolerance through replication of processes.

See dedicated site for more information : www.p2pmpi.org

Schlouder

Schlouder is a client-side broker of IaaS cloud resources. Schlouder provides a user interface very similar to any batch-scheduler to submit a job to cloud-based platforms. Schlouder can manage a set of submissions according to different policies, which may favor speed of completion or cost of the computations. In the context of several clouds, jobs may be directed to one or several resource providers. Schlouder also can provide the client with a simulation of the submission execution plan, given the chosen strategy.

Schlouder uses Slurm as batch-scheduler and either OpenStack or Eucalyptus as cloud kit.

See dedicated site for more information: http://schlouder.gforge.inria.fr