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…

Continue reading

Trick of the day: monitoring the Linux filesystem changes in “real time”

Ever wanted to monitor the filesystem changes ? Since Linux 2.6.25, the kernel provides us with a signal driven I/O notification API and the inotify-tools RPM provides a set of tools to interact with the kernel. inotify in action: a simple way to test this API is to run the…

Continue reading