November 2015 archive

Using dtk within Fortran code and outlook

In the context of the ADT Simon related to the Inria Project Lab (IPL) C2S@Exa dealing with High Performance Computations (HPC), a lot of efforts were made by the dtk team to develop both API and efficient back-ends for parallel sparse linear algebra. Simultaneously, Tristan Cabel modified the Fortran code TRACES from the Andra Institute …

Continue reading »

Deploying Qt based applications without the hassle.

With the advent of the Qt Installer FrameWork (QtIFW), it has never been easier to provide installers for your Qt based applications. Such installers can be either online (i.e. they fetch contents from the internet from repositories during the installation process, thus allowing updates), or offline (i.e. all the contents is bundled into the installer). …

Continue reading »

Immersive space rebirth

The “Immersive Space steering committee” is sponsoring a 6 month intership to promote the use of immersive space as a demonstration area. Every research team is invited to propose an idea of demonstration, a short one page description will suffice. The deadline is 30th of november 2015. The steering committee will select one of these …

Continue reading »

Run a GL application on the Nef cluster with virtualGL

The nef cluster comes with 6 nodes equipped with Nvidia GPUs. Typically, they are used with cuda or opencl to run some highly parallel computations. But you may also run OpenGL applications on them.

Continue reading »

Graph Connected Component Analysis with Bulk-Synchronous-Parallel Processing

In an undirected graph, a connected component is a subgraph in which any two vertices are connected to each other by paths. Usual algorithms build a graph where each vertex is labeled with its component number. They use a search from an unclassified vertex to build the connected component containing this vertex. The process repeats …

Continue reading »