{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"triangle-counting","owner":"Bader-Research","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":4,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-22T14:25:55.608Z"}},{"type":"Public","name":"sorting","owner":"Bader-Research","isFork":false,"description":"Performance evaluation of sequential integer sorting algorithms","allTopics":[],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-06-01T14:33:39.776Z"}},{"type":"Public","name":"snap-graph","owner":"Bader-Research","isFork":false,"description":"SNAP (Small-world Network Analysis and Partitioning) is an extensible parallel framework for exploratory analysis and partitioning of large-scale networks.","allTopics":["graph","parallel","parallel-computing","network-science","social-network-analysis","multicore"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":1,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-12T00:30:01.766Z"}},{"type":"Public","name":"arkouda","owner":"Bader-Research","isFork":true,"description":"Arkouda: NumPy-like arrays at massive scale backed by Chapel (a python/chapel package)","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":1,"issueCount":0,"starsCount":0,"forksCount":87,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-07-19T17:54:37.512Z"}},{"type":"Public","name":"TriangleCentrality-in-GraphBLAS","owner":"Bader-Research","isFork":true,"description":"A GraphBLAS implementation of Paul Burkhardt's Triangle Centrality Algorithm","allTopics":[],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-24T01:19:20.125Z"}},{"type":"Public","name":"DARPA-SSCA2","owner":"Bader-Research","isFork":false,"description":"DARPA UHPC Graph Theory Benchmark (Scalable Synthetic Compact Application #2)","allTopics":["benchmark","graph-algorithms","parallel","parallel-computing","high-performance-computing","graph-theory","supercomputing","parallel-programming"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-28T20:32:57.016Z"}},{"type":"Public","name":"GraphCT","owner":"Bader-Research","isFork":false,"description":"GraphCT: a Graph Characterization Toolkit for the Cray XMT","allTopics":["graph","graph-algorithms","parallel","parallel-computing"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-28T20:32:44.581Z"}},{"type":"Public","name":"gtfold","owner":"Bader-Research","isFork":true,"description":"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. ","allTopics":["biology","parallel","rna-structure","multicore"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":18,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-28T20:32:19.892Z"}},{"type":"Public","name":"CUDARMAT","owner":"Bader-Research","isFork":false,"description":"RMAT Graph Generator for NVIDIA CUDA","allTopics":["graph","gpu","nvidia","gpu-computing","nvidia-cuda","nvidia-gpu"],"primaryLanguage":{"name":"Cuda","color":"#3A4E3A"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-28T20:32:05.477Z"}},{"type":"Public","name":"SWARM","owner":"Bader-Research","isFork":false,"description":"SWARM: Software and Algorithms for Running on Multicore","allTopics":["parallel","parallel-computing","pthreads","parallel-algorithm","multicore","multithreaded","parallel-programming","pthreads-win32","multicore-programming","parallel-primitives"],"primaryLanguage":{"name":"Shell","color":"#89e051"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-28T20:31:58.887Z"}},{"type":"Public","name":"MST","owner":"Bader-Research","isFork":false,"description":"MST: Parallel Minimum Spanning Forest","allTopics":["graph","graph-algorithms","parallel","multicore","multithreaded","supercomputing","minimum-spanning-tree","parallel-algorithms","minimum-spanning-forest","parallel-primitives"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-28T20:31:48.914Z"}},{"type":"Public","name":"SIMPLE","owner":"Bader-Research","isFork":false,"description":"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…","allTopics":["parallel","parallel-computing","cluster-computing","supercomputing","parallel-programming","parallel-algorithms","parallel-primitives"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-28T20:29:57.261Z"}},{"type":"Public","name":"ExactMP","owner":"Bader-Research","isFork":false,"description":"ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony","allTopics":["biology","parallel-computing","phylogenetic-trees","parallel-algorithm","maximum-parsimony"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":3,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-27T22:52:46.426Z"}},{"type":"Public","name":"CellBuzz","owner":"Bader-Research","isFork":false,"description":"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. ","allTopics":["gzip","zlib","parallel-computing","high-performance-computing","fft","rc5","mpeg2","jpeg2000","ibm-cell"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-20T15:59:29.321Z"}},{"type":"Public","name":"BioPerf","owner":"Bader-Research","isFork":false,"description":"BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications","allTopics":["benchmark","bioinformatics","biology","parallel-computing","high-performance-computing","benchmark-suite"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-19T18:47:37.294Z"}},{"type":"Public","name":"MST-ReplacementEdges","owner":"Bader-Research","isFork":false,"description":"MST-ReplacementEdges: Find Minimum Spanning Tree Replacement Edges","allTopics":["graph","mst","graph-theory","tarjan-algorithm","disjoint-sets","minimum-spanning-tree","disjoint-unions","graph-algorithm"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-16T18:24:54.594Z"}},{"type":"Public","name":"GTgraph","owner":"Bader-Research","isFork":false,"description":"GTgraph: A suite of synthetic random graph generators","allTopics":["benchmark","graph","network-science","graph-generator","graph-benchmark","dimacs-format"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":1,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-14T14:43:01.191Z"}},{"type":"Public","name":"PSRS","owner":"Bader-Research","isFork":false,"description":"PSRS: Parallel Sorting using Regular Sampling","allTopics":["parallel","mpi","sorting-algorithms","parallel-algorithm","sorting-algorithms-implemented","multicore","supercomputing","parallel-sorting"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-13T15:41:39.575Z"}},{"type":"Public","name":"ImageU","owner":"Bader-Research","isFork":false,"description":"ImageU: Parallel Combinatorial Algorithms","allTopics":["parallel","parallel-computing","histogram","image-processing","segmentation","region-growing","column-sorting","multicore","radix-sort","connected-components","supercomputing","parallel-programming","median-finding","parallel-sorting","parallel-image-processing"],"primaryLanguage":{"name":"SuperCollider","color":"#46390b"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T17:29:21.457Z"}},{"type":"Public","name":"PMedian","owner":"Bader-Research","isFork":false,"description":"PMedian: Parallel Selection and Median Finding","allTopics":["parallel","mpi","selection","parallel-algorithm","median","supercomputing","median-finding","selection-algorithm","parallel-primitives"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T17:08:13.193Z"}},{"type":"Public","name":"PSort","owner":"Bader-Research","isFork":false,"description":"PSort: Parallel Sorting using Sampling with Randomized and Deterministic Approaches","allTopics":["sorting","parallel","sorting-algorithms","sorting-algorithms-implemented","multicore","supercomputing","randomized-algorithms","parallel-sorting","parallel-algorithms","parallel-primitives"],"primaryLanguage":{"name":"SuperCollider","color":"#46390b"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T16:46:44.597Z"}},{"type":"Public","name":"Cycle-Detection","owner":"Bader-Research","isFork":false,"description":"Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs","allTopics":["graph","parallel","mpi","parallel-computing","parallel-algorithm","planar-graphs","supercomputing","cycle-detection","graph-algorithm","parallel-primitives"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T16:40:45.102Z"}},{"type":"Public","name":"Rake","owner":"Bader-Research","isFork":false,"description":"Rake: Parallel Expression Evaluation using Tree Contraction","allTopics":["parallel","parallel-computing","rake","parallel-algorithm","expression-evaluator","multicore","multithreaded","parallel-primitives","tree-contraction"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T15:55:27.408Z"}},{"type":"Public","name":"ParJedi","owner":"Bader-Research","isFork":false,"description":"ParJedi: Parallel Code for the State Assignment of large Finite State Machines","allTopics":["parallel","finite-state-machine","parallel-algorithm","multicore","multithreaded"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":1,"starsCount":1,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T15:50:37.283Z"}},{"type":"Public","name":"Spanning-Tree","owner":"Bader-Research","isFork":false,"description":"Spanning-Tree: Parallel Spanning Tree","allTopics":["graph","parallel-computing","parallel-algorithm","multicore","multithreaded","spanning-tree"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T15:42:49.020Z"}},{"type":"Public","name":"GRAPPA","owner":"Bader-Research","isFork":false,"description":"GRAPPA: Genome Rearrangements Analysis under Parsimony and other Phylogenetic Algorithms","allTopics":["biology","phylogenetic-trees","phylogenetics","phylogenetic-analysis"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T03:41:37.355Z"}},{"type":"Public","name":"biconnected-components","owner":"Bader-Research","isFork":false,"description":"Parallel Biconnected Components","allTopics":["graph-algorithms","parallel","multithreaded","parallel-algorithms","parallel-primitives","biconnected-components"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T03:29:03.062Z"}},{"type":"Public","name":"ListRanking","owner":"Bader-Research","isFork":false,"description":"Parallel List Ranking for multicore processors","allTopics":["parallel","parallel-computing","high-performance-computing","multicore","multithreaded","supercomputing","parallel-algorithms","list-ranking","parallel-primitives"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T03:17:52.006Z"}},{"type":"Public","name":"pasqual","owner":"Bader-Research","isFork":false,"description":"Pasqual: a Parallel de Novo Genome Sequence Assembler","allTopics":["biology","parallel","sequence-assembler"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-11T02:43:06.198Z"}},{"type":"Public","name":"DCJUC","owner":"Bader-Research","isFork":true,"description":"Maximum Parsimonious Tree Construction","allTopics":[],"primaryLanguage":{"name":"Roff","color":"#ecdebe"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-07-20T02:22:06.325Z"}}],"repositoryCount":34,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Bader-Research repositories"}