David Bader's Research Group

David Bader's Research Group's repositories

GTgraph

GTgraph: A suite of synthetic random graph generators

Language:CGPL-3.07 20

snap-graph

SNAP (Small-world Network Analysis and Partitioning) is an extensible parallel framework for exploratory analysis and partitioning of large-scale networks.

Language:CBSD-3-Clause7 30

CellBuzz: The Sony-Toshiba-IBM Cell Broadband Engine is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-processing units (SPEs) integrated on-chip. This repository contains Cell B.E. optimized libraries and software for FFT, MPEG, compression, and encryption.

Language:C4 20

ListRanking

Parallel List Ranking for multicore processors

Language:CBSD-3-Clause4 20

MST

MST: Parallel Minimum Spanning Forest

Language:CBSD-3-Clause4 20

BioPerf

BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications

Language:C3 10

DARPA-SSCA2

DARPA UHPC Graph Theory Benchmark (Scalable Synthetic Compact Application #2)

Language:CGPL-3.02 20

MST-ReplacementEdges

MST-ReplacementEdges: Find Minimum Spanning Tree Replacement Edges

Language:CBSD-3-Clause2 30

triangle-counting

Language:Jupyter NotebookApache-2.02 10

biconnected-components

Parallel Biconnected Components

Language:CBSD-3-Clause1 20

CUDARMAT

RMAT Graph Generator for NVIDIA CUDA

Language:CudaBSD-3-Clause1 20

GRAPPA

GRAPPA: Genome Rearrangements Analysis under Parsimony and other Phylogenetic Algorithms

Language:CGPL-3.01 20

ParJedi

ParJedi: Parallel Code for the State Assignment of large Finite State Machines

Language:CBSD-3-Clause1 2 1

PSRS

PSRS: Parallel Sorting using Regular Sampling

Language:CBSD-3-Clause1 20

SIMPLE

SIMPLE is a framework for implementation of parallel algorithms using our methodology for developing high performance programs running on clusters of SMP nodes. Our methodology is based on a small kernel (SIMPLE) of collective communication primitives that make efficient use of the hybrid shared and message passing environment. We illustrate the power of our methodology by presenting experimental results for sorting integers, two-dimensional fast Fourier transforms (FFT), and constraint-satisfied searching.

Language:CBSD-3-Clause1 30

SWARM

SWARM: Software and Algorithms for Running on Multicore

Language:ShellBSD-3-Clause1 20

arkouda

Arkouda: NumPy-like arrays at massive scale backed by Chapel (a python/chapel package)

Language:PythonNOASSERTION010

Cycle-Detection

Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs

Language:CBSD-3-Clause020

DCJUC

Maximum Parsimonious Tree Construction

Language:Roff010

ExactMP

ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony

Language:CBSD-3-Clause01 3

GraphCT

GraphCT: a Graph Characterization Toolkit for the Cray XMT

Language:CBSD-3-Clause020

gtfold

GTfold is a fast, scalable multicore code for predicting RNA secondary structure and is one to two orders of magnitude faster than the de facto standard programs and achieves comparable accuracy of prediction.

Language:C++GPL-3.0010