{"payload":{"pageCount":3,"repositories":[{"type":"Public","name":"leiden-communities-openmp-dynamic","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based Dynamic Leiden algorithm for community detection.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-26T18:23:24.718Z"}},{"type":"Public","name":"rak-communities-openmp","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based Parallel Label Propagation Algorithm (LPA) algorithm, aka RAK, for community detection.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-16T20:09:49.542Z"}},{"type":"Public","name":"puzzlef.github.io","owner":"puzzlef","isFork":false,"description":"A summary of experiments.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-16T15:33:00.795Z"}},{"type":"Public","name":"graph-csr-openmp","owner":"puzzlef","isFork":false,"description":"Design of high-performance OpenMP-based parallel Graph Edgelist and Compressed Sparse Row (CSR) loader, aka GVEL.","topicNames":["parser","algorithm","graph","parallel","openmp","load","csr","edgelist","gvel"],"topicsNotShown":0,"allTopics":["parser","algorithm","graph","parallel","openmp","load","csr","edgelist","gvel"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-05T15:11:01.609Z"}},{"type":"Public","name":"louvain-communities-openmp-dynamic","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based Parallel Dynamic Louvain algorithm for community detection.","topicNames":["community","experiment","algorithm","graph","optimization","detection","openmp","multithreading","modularity","louvain"],"topicsNotShown":2,"allTopics":["community","experiment","algorithm","graph","optimization","detection","openmp","multithreading","modularity","louvain","agglomerative","iterative"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-01T13:07:25.910Z"}},{"type":"Public","name":"leiden-communities-openmp","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based Parallel Leiden algorithm for community detection.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":5,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-25T07:04:47.633Z"}},{"type":"Public","name":"louvain-communities-openmp","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based Parallel Louvain algorithm for community detection, that prevents internally disconnected communities.","topicNames":["community","experiment","algorithm","graph","optimization","detection","greedy","modularity","louvain","hierarchical"],"topicsNotShown":2,"allTopics":["community","experiment","algorithm","graph","optimization","detection","greedy","modularity","louvain","hierarchical","agglomerative","iterative"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-25T07:04:25.374Z"}},{"type":"Public","name":"neighborhood-link-prediction-openmp","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based Parallel Neighborhood-based Link prediction approaches.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-25T07:04:16.894Z"}},{"type":"Public","name":"pagerank-openmp-dynamic","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based Parallel Dynamic PageRank algorithm for measuring importance.","topicNames":["experiment","graph","analysis","pagerank","multithreading","link","iterative","algorithm","openmp"],"topicsNotShown":0,"allTopics":["experiment","graph","analysis","pagerank","multithreading","link","iterative","algorithm","openmp"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-25T07:04:01.960Z"}},{"type":"Public","name":"pagerank-cuda-dynamic","owner":"puzzlef","isFork":false,"description":"Design of CUDA-based Parallel Dynamic PageRank algorithm for measuring importance.","topicNames":["algorithm","graph","gpu","static","cuda","pagerank","temporal"],"topicsNotShown":0,"allTopics":["algorithm","graph","gpu","static","cuda","pagerank","temporal"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-25T07:02:59.975Z"}},{"type":"Public","name":"pagerank-barrierfree-openmp-dynamic","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based Lock-free Dynamic PageRank algorithm for link analysis.","topicNames":["experiment","algorithm","graph","analysis","openmp","pagerank","multithreading","link","iterative"],"topicsNotShown":0,"allTopics":["experiment","algorithm","graph","analysis","openmp","pagerank","multithreading","link","iterative"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-27T16:33:43.930Z"}},{"type":"Public","name":"pagerank-levelwise-multi-dynamic","owner":"puzzlef","isFork":false,"description":"Comparision of OpenMP and CUDA-based, Monolithic and Levelwise Dynamic PageRank algorithms.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-10T15:57:41.397Z"}},{"type":"Public","name":"core-performance-openmp","owner":"puzzlef","isFork":false,"description":"Measure the performance of individual cores with OpenMP.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-27T05:11:36.324Z"}},{"type":"Public","name":"graph-openmp","owner":"puzzlef","isFork":false,"description":"OpenMP-based Parallel Graph implementation.","topicNames":["data","graph","structure","parallel","openmp","in","digraph","weighted","undirected","directed"],"topicsNotShown":1,"allTopics":["data","graph","structure","parallel","openmp","in","digraph","weighted","undirected","directed","mtx"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-16T03:10:26.193Z"}},{"type":"Public","name":"mmap-access-pattern-openmp","owner":"puzzlef","isFork":false,"description":"Design a fast parallel memory access pattern for a memory-mapped file with mmap().","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-05T11:11:21.091Z"}},{"type":"Public","name":"hello-mpi","owner":"puzzlef","isFork":false,"description":"A basic \"Hello world\" example to output text to console from nodes over a network using MPI.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-21T19:04:35.201Z"}},{"type":"Public","name":"hello-cuda","owner":"puzzlef","isFork":false,"description":"A basic \"Hello world\" or \"Hello CUDA\" example to perform a number of operations on NVIDIA GPUs using CUDA.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Cuda","color":"#3A4E3A"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-21T18:50:24.302Z"}},{"type":"Public","name":"prefix-scan-cuda","owner":"puzzlef","isFork":false,"description":"Design of an efficient algorithm for parallel prefix-scan of a large array of values on GPUs.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-10T13:41:13.584Z"}},{"type":"Public","name":"graph-pagerank-distribution","owner":"puzzlef","isFork":false,"description":"Obtain the PageRank distribution of a static graph (in MTX format).","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-07-03T18:49:15.318Z"}},{"type":"Public","name":"graph-degree-distribution","owner":"puzzlef","isFork":false,"description":"Obtain the degree distribution of a static graph (in MTX format).","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-06-18T01:56:48.351Z"}},{"type":"Public","name":"pthread-block","owner":"puzzlef","isFork":false,"description":"Design of pthread-block as a replacement for OpenMP threads,","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-05-15T09:13:34.355Z"}},{"type":"Public","name":"vector-search","owner":"puzzlef","isFork":false,"description":"Comparing approaches for searching an element in a vector.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-05T07:00:21.760Z"}},{"type":"Public","name":"pagerank-levelwise-cuda-dynamic","owner":"puzzlef","isFork":false,"description":"Design of CUDA-based Levelwise Dynamic PageRank algorithm for link analysis.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-05T06:26:17.984Z"}},{"type":"Public","name":"pagerank-levelwise-cuda","owner":"puzzlef","isFork":false,"description":"Design of CUDA-based Levelwise PageRank algorithm for link analysis.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-05T06:22:47.320Z"}},{"type":"Public","name":"pagerank-levelwise-dynamic","owner":"puzzlef","isFork":false,"description":"Design of Levelwise Dynamic PageRank algorithm for link analysis.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-05T06:17:31.566Z"}},{"type":"Public","name":"pagerank-levelwise","owner":"puzzlef","isFork":false,"description":"Design of Levelwise PageRank algorithm for link analysis.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-05T06:14:45.176Z"}},{"type":"Public","name":"pagerank-barrierfrees-openmp-dynamic","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based statically scheduled Barrier-free Dynamic PageRank algorithm for link analysis.","topicNames":["experiment","algorithm","analysis","openmp","pagerank","multithreading","link","iterative","graph"],"topicsNotShown":0,"allTopics":["experiment","algorithm","analysis","openmp","pagerank","multithreading","link","iterative","graph"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-04T15:50:10.283Z"}},{"type":"Public","name":"pagerank-barrierfrees-openmp","owner":"puzzlef","isFork":false,"description":"Design of OpenMP-based statically scheduled Barrier-free PageRank algorithm for link analysis.","topicNames":["experiment","algorithm","graph","analysis","openmp","pagerank","multithreading","link","iterative"],"topicsNotShown":0,"allTopics":["experiment","algorithm","graph","analysis","openmp","pagerank","multithreading","link","iterative"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-03T10:32:34.809Z"}},{"type":"Public","name":"pair-bitset","owner":"puzzlef","isFork":false,"description":"Design of bitset for storing key-value pairs.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-02T15:24:21.970Z"}},{"type":"Public","name":"pagerank-cuda-optimization","owner":"puzzlef","isFork":false,"description":"Exploration of optimizations to CUDA-based PageRank algorithm for link analysis.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-02T14:37:05.398Z"}}],"repositoryCount":61,"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":"Repositories"}