Over the years, the research in the lab has resulted in the development of a number
of software tools and libraries for key problems in the areas of parallel processing,
data mining, bioinformatics, and collaborative filtering.
It is our general policy to make these tools available to the research community for
use in their own research and/or noncommercial applications.
Here is a list of software tools that can be downloaded.
METIS: A Family of Multilevel Partitioning Algorithms


This is a collection of serial and parallel programs & libraries
that can be used to partitioning unstructured graphs, finite element
meshes, and hypergraphs, both on serial as well as on parallel computers.

CLUTO: Software for Clustering HighDimensional DataSets


This is a collection of computationally efficient and highquality
data clustering and cluster analysis programs & libraries, that
are well suited for highdimensional data sets.

BDMPI: Big Data Message Passing Interface


BDMPI is a message passing library and associated runtime system for developing outofcore distributed computing applications for problems whose aggregate memory requirements exceed the amount of memory that is available on the underlying computing cluster.

SLIM  Sparse Linear Methods for TopN Recommender Systems


This is a library that implements a set of topN recommendation methods that learn an itemitem similarity matrix using sparse linear models.

NERSTRAND  Multithreaded modularitybased graph clustering


This is a program that implements various serial and parallel modularitybased graph clustering algorithms based on the multilevel paradigm. These algorithms can produce highquality clustering solutions and can scale to very large graphs.

SPLATT  Parallel Sparse Tensor Decomposition


This is a software toolkit for parallel sparse tensor factorization. It contains a memory and operationefficient algorithms that allows it to compute PARAFAC decompositions on large datasets.

L2AP  Fast Cosine Similarity Search With Prefix L2 Norm Bounds


This is a program that implements various fast algorithms for for finding the set of all pairs of similar vectors (e.g., documents) whose similarity is greater than a userspecified threshold.

L2Knng  Fast KNearest Neighbor Graph Construction with L2Norm Pruning 

This is a program that provides highperformance implementations of several methods for constructing the Knearest neighbor graph of a set of vectors based on cosine similarity.

PAFI: Software for Finding Patterns in Diverse Datasets


This is a collection of computationally efficient programs for finding
frequent patterns in transactional, sequential, and graph datasets.

AFGen: Fragmentbased Descriptors for Chemical Compounds


This is a program that generates a descriptorbased representation of a set of chemical compounds based on the fragments that they contain.

SUGGEST: A topN Recommender Engine


This is a collection of various topN recommendation
algorithms based on collaborative filtering.

MGridGen: Multilevel Serial & Parallel Coarse Grid Construction Library


This is a highlyoptimized serial and parallel library for obtaining
a sequence of successive coarse grids that are wellsuited for geometric
multigrid methods. The quality of the elements of the coarse grids
is optimized using a multilevel framework. The parallel library is
based on MPI and is portable to a widerange of architectures.

PSPASES: A Parallel Sparse Direct Solver


This is an MPIbased parallel library for solving a linear system of equations
Ax=b, where A is sparse and symmetric positive definite, using Cholesky
factorization.
