Pinned Repositories
biconnected-components
Parallel Biconnected Components
BioPerf
BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications
CellBuzz
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.
DARPA-SSCA2
DARPA UHPC Graph Theory Benchmark (Scalable Synthetic Compact Application #2)
GTgraph
GTgraph: A suite of synthetic random graph generators
ListRanking
Parallel List Ranking for multicore processors
MST
MST: Parallel Minimum Spanning Forest
MST-ReplacementEdges
MST-ReplacementEdges: Find Minimum Spanning Tree Replacement Edges
snap-graph
SNAP (Small-world Network Analysis and Partitioning) is an extensible parallel framework for exploratory analysis and partitioning of large-scale networks.
triangle-counting
David Bader's Research Group's Repositories
Bader-Research/GTgraph
GTgraph: A suite of synthetic random graph generators
Bader-Research/snap-graph
SNAP (Small-world Network Analysis and Partitioning) is an extensible parallel framework for exploratory analysis and partitioning of large-scale networks.
Bader-Research/CellBuzz
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.
Bader-Research/ListRanking
Parallel List Ranking for multicore processors
Bader-Research/MST
MST: Parallel Minimum Spanning Forest
Bader-Research/triangle-counting
Bader-Research/BioPerf
BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications
Bader-Research/DARPA-SSCA2
DARPA UHPC Graph Theory Benchmark (Scalable Synthetic Compact Application #2)
Bader-Research/MST-ReplacementEdges
MST-ReplacementEdges: Find Minimum Spanning Tree Replacement Edges
Bader-Research/biconnected-components
Parallel Biconnected Components
Bader-Research/CUDARMAT
RMAT Graph Generator for NVIDIA CUDA
Bader-Research/GRAPPA
GRAPPA: Genome Rearrangements Analysis under Parsimony and other Phylogenetic Algorithms
Bader-Research/ParJedi
ParJedi: Parallel Code for the State Assignment of large Finite State Machines
Bader-Research/PMedian
PMedian: Parallel Selection and Median Finding
Bader-Research/PSRS
PSRS: Parallel Sorting using Regular Sampling
Bader-Research/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.
Bader-Research/SWARM
SWARM: Software and Algorithms for Running on Multicore
Bader-Research/arkouda
Arkouda: NumPy-like arrays at massive scale backed by Chapel (a python/chapel package)
Bader-Research/Cycle-Detection
Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs
Bader-Research/DCJUC
Maximum Parsimonious Tree Construction
Bader-Research/ExactMP
ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
Bader-Research/GraphCT
GraphCT: a Graph Characterization Toolkit for the Cray XMT
Bader-Research/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.
Bader-Research/ImageU
ImageU: Parallel Combinatorial Algorithms
Bader-Research/pasqual
Pasqual: a Parallel de Novo Genome Sequence Assembler
Bader-Research/PSort
PSort: Parallel Sorting using Sampling with Randomized and Deterministic Approaches
Bader-Research/Rake
Rake: Parallel Expression Evaluation using Tree Contraction
Bader-Research/sorting
Performance evaluation of sequential integer sorting algorithms
Bader-Research/Spanning-Tree
Spanning-Tree: Parallel Spanning Tree
Bader-Research/TriangleCentrality-in-GraphBLAS
A GraphBLAS implementation of Paul Burkhardt's Triangle Centrality Algorithm