{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"cudaf.github.io","owner":"cudaf","isFork":false,"description":"A summary of CUDA examples.","allTopics":["cpp","gpu","example","cuda","nvidia","by"],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T14:55:54.979Z"}},{"type":"Public","name":"hello-world","owner":"cudaf","isFork":false,"description":"A \"Hello, World!\" program generally is a computer program that outputs or displays the message \"Hello, World!\".","allTopics":["hello","world","cpu","cpp","print","gpu","cuda"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T14:28:08.671Z"}},{"type":"Public","name":"matrix-multiplication","owner":"cudaf","isFork":false,"description":"The resultant of two matrices, formed by calculating dot-product of respective components is called matrix multiplication.","allTopics":["product","cpp","simple","multiplication","tiled","gpu","matrix","cuda"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T14:10:24.017Z"}},{"type":"Public","name":"malloc-test","owner":"cudaf","isFork":false,"description":"malloc() is a function for dynamic memory allocation in C.","allTopics":["performance","cpp","test","dynamic","host","malloc","allocation","pinned","alloc","memory","gpu","cuda"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T13:22:41.297Z"}},{"type":"Public","name":"histogram","owner":"cudaf","isFork":false,"description":"Histogram represents a count of the frequency of each element in a data set.","allTopics":["events","cpp","memory","histogram","byte","shared","atomics","gpu","cuda"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T13:11:39.774Z"}},{"type":"Public","name":"dot-product","owner":"cudaf","isFork":false,"description":"The scalar product of two vectors is called dot product.","allTopics":["product","cpp","vector","scalar","cuda","dot","gpu"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T13:10:54.282Z"}},{"type":"Public","name":"choose-device","owner":"cudaf","isFork":false,"description":"Selection of compute-device which best matches criteria.","allTopics":["device","cpp","properties","criteria","choose","gpu","cuda"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T13:10:01.542Z"}},{"type":"Public","name":"device-properties","owner":"cudaf","isFork":false,"description":"The properties of a compute device can used for knowing how much memory and what capabilities the device has.","allTopics":["device","cpp","memory","gpu","properties","capabilities","cuda"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T13:09:07.011Z"}},{"type":"Public","name":"addition","owner":"cudaf","isFork":false,"description":"Addition is the process of calculating the total of two or more numbers or amounts.","allTopics":["cpp","number","add","gpu","cuda"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T13:08:12.924Z"}},{"type":"Public","name":"vector-sum","owner":"cudaf","isFork":false,"description":"The resultant of two vectors, calculated by adding respective components of each vector is called vector sum.","allTopics":["components","cpp","simple","vector","sum","streams","long","multiple","chunked","resultant","addition","interleaved","gpu","cuda"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-02T13:07:11.171Z"}},{"type":"Public","name":"learn-cugraph-louvain","owner":"cudaf","isFork":false,"description":"Testing Louvain community detection example from RAPIDS cuGraph.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-08-19T20:50:13.292Z"}},{"type":"Public","name":"pagerank-sparse","owner":"cudaf","isFork":false,"description":"PageRank (PR) algorithm for sparse graphs using CUDA Toolkit.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-06-08T15:22:48.912Z"}},{"type":"Public","name":"pagerank-sticd","owner":"cudaf","isFork":false,"description":"PageRank (PR) algorithm for sparse graphs using STIC-D algorithm.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-03-17T14:36:29.284Z"}},{"type":"Public","name":"pagerank-dense","owner":"cudaf","isFork":false,"description":"PageRank (PR) algorithm for dense graphs using CUDA Toolkit.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-03-17T07:02:53.541Z"}},{"type":"Public","name":"apsp","owner":"cudaf","isFork":false,"description":"All pairs shortest path.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-06T17:46:18.028Z"}}],"repositoryCount":15,"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":"cudaf repositories"}