David Bader's Research Group

Pinned Repositories

biconnected-components
Parallel Biconnected Components
Language:C1 2 00
BioPerf
BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications
Language:C3 1 00
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.
Language:C4 2 00
DARPA-SSCA2
DARPA UHPC Graph Theory Benchmark (Scalable Synthetic Compact Application #2)
Language:C2 2 00
GTgraph
GTgraph: A suite of synthetic random graph generators
Language:C7 2 01
ListRanking
Parallel List Ranking for multicore processors
Language:C4 2 00
MST
MST: Parallel Minimum Spanning Forest
Language:C4 2 00
MST-ReplacementEdges
MST-ReplacementEdges: Find Minimum Spanning Tree Replacement Edges
Language:C2 3 00
snap-graph
SNAP (Small-world Network Analysis and Partitioning) is an extensible parallel framework for exploratory analysis and partitioning of large-scale networks.
Language:C7 3 01
triangle-counting
Language:Jupyter Notebook2 1 04

David Bader's Research Group's Repositories

Bader-Research/GTgraph
GTgraph: A suite of synthetic random graph generators
Language:C7 2 01
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.
Language:C7 3 01
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.
Language:C4 2 00
Bader-Research/ListRanking
Parallel List Ranking for multicore processors
Language:C4 2 00
Bader-Research/MST
MST: Parallel Minimum Spanning Forest
Language:C4 2 00
Bader-Research/BioPerf
BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications
Language:C3 1 00
Bader-Research/DARPA-SSCA2
DARPA UHPC Graph Theory Benchmark (Scalable Synthetic Compact Application #2)
Language:C2 2 00
Bader-Research/MST-ReplacementEdges
MST-ReplacementEdges: Find Minimum Spanning Tree Replacement Edges
Language:C2 3 00
Bader-Research/triangle-counting
Language:Jupyter Notebook2 1 04
Bader-Research/biconnected-components
Parallel Biconnected Components
Language:C1 2 00
Bader-Research/CUDARMAT
RMAT Graph Generator for NVIDIA CUDA
Language:Cuda1 2 0
Bader-Research/GRAPPA
GRAPPA: Genome Rearrangements Analysis under Parsimony and other Phylogenetic Algorithms
Language:C1 2 00
Bader-Research/ParJedi
ParJedi: Parallel Code for the State Assignment of large Finite State Machines
Language:C1 2 10
Bader-Research/PSRS
PSRS: Parallel Sorting using Regular Sampling
Language:C1 2 0
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.
Language:C1 3 00
Bader-Research/SWARM
SWARM: Software and Algorithms for Running on Multicore
Language:Shell1 2 00
Bader-Research/arkouda
Arkouda: NumPy-like arrays at massive scale backed by Chapel (a python/chapel package)
Language:Python1 02
Bader-Research/Cycle-Detection
Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs
Language:C2 0
Bader-Research/DCJUC
Maximum Parsimonious Tree Construction
Language:Roff1 0
Bader-Research/ExactMP
ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
Language:C1 3
Bader-Research/GraphCT
GraphCT: a Graph Characterization Toolkit for the Cray XMT
Language:C2 0
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.
Language:C++1 0
Bader-Research/ImageU
ImageU: Parallel Combinatorial Algorithms
Language:SuperCollider2 0
Bader-Research/pasqual
Pasqual: a Parallel de Novo Genome Sequence Assembler
Language:C2 0
Bader-Research/PMedian
PMedian: Parallel Selection and Median Finding
Language:C2 0
Bader-Research/PSort
PSort: Parallel Sorting using Sampling with Randomized and Deterministic Approaches
Language:SuperCollider2 0
Bader-Research/Rake
Rake: Parallel Expression Evaluation using Tree Contraction
Language:C2 0
Bader-Research/sorting
Performance evaluation of sequential integer sorting algorithms
Language:C0 0
Bader-Research/Spanning-Tree
Spanning-Tree: Parallel Spanning Tree
Language:C2 0
Bader-Research/TriangleCentrality-in-GraphBLAS
A GraphBLAS implementation of Paul Burkhardt's Triangle Centrality Algorithm
Language:C0 0